{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:23:52Z","timestamp":1759937032676},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1007\/bf02122798","type":"journal-article","created":{"date-parts":[[2005,9,14]],"date-time":"2005-09-14T15:43:20Z","timestamp":1126712600000},"page":"177-184","source":"Crossref","is-referenced-by-count":2,"title":["Matrices with prescribed row, column and block sums"],"prefix":"10.1007","volume":"8","author":[{"given":"Zh. A.","family":"Chernyak","sequence":"first","affiliation":[]},{"given":"A. A.","family":"Chernyak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02122798_CR1","volume-title":"Graph and Hypergraphs","author":"C. Berge","year":"1970","unstructured":"C. Berge,Graph and Hypergraphs, Dunod, Paris, 1970."},{"key":"BF02122798_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BFb0091814","volume":"884","author":"D. Billington","year":"1981","unstructured":"D. Billington, Connected subgraphs of the graph of multigraphic realizations of a degree sequences,Lect. Notes Math. 884 (1981), 125\u2013135.","journal-title":"Lect. Notes Math."},{"key":"BF02122798_CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0024-3795(80)90105-6","volume":"33","author":"R. A. Brualdi","year":"1980","unstructured":"R. A. Brualdi, Matrices of zeros and ones with fixed row and column sum vectors,Lin. Al. Appl. 33 (1980), 159\u2013231.","journal-title":"Lin. Al. Appl."},{"key":"BF02122798_CR4","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1111\/j.1749-6632.1979.tb32837.x","volume":"319","author":"M. Capobianco","year":"1979","unstructured":"M. Capobianco, S. Maurer, D. McCarthy andJ. Molluzo, A collection of open problems,Ann. N.-Y. Acad. Sci. 319 (1979), 565\u2013590.","journal-title":"Ann. N.-Y. Acad. Sci."},{"key":"BF02122798_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0012-365X(74)80016-6","volume":"7","author":"V. Changphaisan","year":"1974","unstructured":"V. Changphaisan, Conditions for sequence to ber-graphic,Discrete Math. 7 (1974), 31\u201339.","journal-title":"Discrete Math."},{"key":"BF02122798_CR6","first-page":"497","volume":"27","author":"Zh. A. Chernyak","year":"1983","unstructured":"Zh. A. Chernyak, Characterization of self-complimentary degree sequences,Doklady Acad. Nayk BSSR 27 (1983), 497\u2013500.","journal-title":"Doklady Acad. Nayk BSSR"},{"key":"BF02122798_CR7","first-page":"43","volume":"3","author":"Zh. A. Chernyak","year":"1982","unstructured":"Zh. A. Chernyak, Connected realizations of edge degree sequences,Izvestia Akad. Nauk BSSR. Ser. Fiz.-Mat. Nayk 3 (1982), 43\u201347.","journal-title":"Izvestia Akad. Nauk BSSR. Ser. Fiz.-Mat. Nayk"},{"key":"BF02122798_CR8","first-page":"594","volume":"25","author":"Zh. A. Chernyak","year":"1981","unstructured":"Zh. A. Chernyak andA. A. Chernyak, Edge degree sequences and their realizations,Doklady Akad. Nauk BSSR 25 (1981), 594\u2013598.","journal-title":"Doklady Akad. Nauk BSSR"},{"key":"BF02122798_CR9","volume-title":"Tech. Report CS-77-37","author":"C. J. Colbourn","year":"1977","unstructured":"C. J. Colbourn, Graph generation.Dept. of Computer Science, University of Waterloo, Canada, Tech. Report CS-77-37, 1977."},{"key":"BF02122798_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0012-365X(83)90175-9","volume":"45","author":"P. Das","year":"1983","unstructured":"P. Das, Unigraphic and Unidigraphic degree sequences through uniquely realizable integer-pair sequences,Discrete Math. 45 (1983), 45\u201359.","journal-title":"Discrete Math."},{"key":"BF02122798_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0102679","volume":"748","author":"R. B. Eggleton","year":"1979","unstructured":"R. B. Eggleton andD. A. Holton, Graphic sequences,Lect. Notes Math. 748 (1979), 1\u201310.","journal-title":"Lect. Notes Math."},{"key":"BF02122798_CR12","doi-asserted-by":"crossref","first-page":"166","DOI":"10.4153\/CJM-1965-016-2","volume":"17","author":"D. R. Fulkerson","year":"1965","unstructured":"D. R. Fulkerson, A. J. Hoffman andM. H. McAndrew, Some properties of graphs with multiple edges,Canad, J. Math. 17 (1965), 166\u2013177.","journal-title":"Canad, J. Math."},{"key":"BF02122798_CR13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0012-365X(73)90037-X","volume":"6","author":"D. J. Kleitman","year":"1973","unstructured":"D. J. Kleitman andD. L. Wang, Algorithms for constructing graphs, digraphs with given valences and factors,Discrete Math. 6 (1973), 79\u201388.","journal-title":"Discrete Math."},{"key":"BF02122798_CR14","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0012-365X(73)90068-X","volume":"6","author":"S. Kundu","year":"1973","unstructured":"S. Kundu, Thek-factor conjecture is true,Discrete Math. 6 (1973), 367\u2013376.","journal-title":"Discrete Math."},{"key":"BF02122798_CR15","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0012-365X(76)90048-0","volume":"15","author":"A. N. Patrinos","year":"1976","unstructured":"A. N. Patrinos andS. L. Hakimi, Relations between graphs and integerpair sequences,Discrete Math. 15 (1976). 347\u2013358.","journal-title":"Discrete Math."},{"key":"BF02122798_CR16","doi-asserted-by":"crossref","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","volume":"9","author":"H. J. Ryser","year":"1957","unstructured":"H. J. Ryser, Combinatorial properties of matrices of zeros and ones,Canad. J. Math. 9 (1957), 371\u2013377.","journal-title":"Canad. J. Math."},{"key":"BF02122798_CR17","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0012-365X(83)90053-5","volume":"44","author":"R. P. Anstee","year":"1983","unstructured":"R. P. Anstee, The network flows approach for matrices with given row and column sums,Discrete Math. 44 (1983), 125\u2013138.","journal-title":"Discrete Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122798.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02122798\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T01:22:31Z","timestamp":1557796951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02122798"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["BF02122798"],"URL":"https:\/\/doi.org\/10.1007\/bf02122798","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}