{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T01:03:36Z","timestamp":1781139816947,"version":"3.54.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0195-6698(03)00030-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:36:00Z","timestamp":1051115760000},"page":"413-430","source":"Crossref","is-referenced-by-count":42,"title":["Split graphs"],"prefix":"10.1016","volume":"24","author":[{"given":"Russell","family":"Merris","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(03)00030-1_B1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0024-3795(94)90349-2","article-title":"Degree sequences and majorization","volume":"199","author":"Arikati","year":"1994","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0195-6698(03)00030-1_B2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0024-3795(98)10229-X","article-title":"The realization graph of a degree sequence with majorization gap 1 is Hamiltonian","volume":"290","author":"Arikati","year":"1999","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0195-6698(03)00030-1_B3","unstructured":"J.T.B. Beard Jr., A.D. Dorris, On uniquely realizable degree sequences (manuscript)"},{"key":"10.1016\/S0195-6698(03)00030-1_B4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","article-title":"Aggregation of inequalities in integer programming","volume":"1","author":"Chv\u00e1tal","year":"1977","journal-title":"Annals Disc. Math."},{"key":"10.1016\/S0195-6698(03)00030-1_B5","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF02571719","article-title":"Free hyperplane arrangements between An\u22121 and Bn","volume":"215","author":"Edelman","year":"1994","journal-title":"Math. Z."},{"key":"10.1016\/S0195-6698(03)00030-1_B6","series-title":"Proceedings of the 8th South-Eastern Conference on Combinatorics","first-page":"311","article-title":"Split graphs","author":"Foldes","year":"1977"},{"key":"10.1016\/S0195-6698(03)00030-1_B7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1006\/eujc.1996.0096","article-title":"The Erd\u00f6s-Gallai criterion and symmetric functions","volume":"18","author":"Gasharov","year":"1997","journal-title":"European J. Combin."},{"key":"10.1016\/S0195-6698(03)00030-1_B8","first-page":"73","article-title":"Konstruktion schlichter Graphen mit gegebener Gradpartition (Construction of univalent graphs with given partition by degree)","volume":"44","author":"Grund","year":"1993","journal-title":"Bayreuth. Math. Schr."},{"key":"10.1016\/S0195-6698(03)00030-1_B9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1137\/0602006","article-title":"Threshold sequences","volume":"2","author":"Hammer","year":"1981","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"10.1016\/S0195-6698(03)00030-1_B10","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02579333","article-title":"The splittance of a graph","volume":"1","author":"Hammer","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0195-6698(03)00030-1_B11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(87)90050-3","article-title":"Hamiltonian threshold graphs","volume":"16","author":"Harary","year":"1987","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/S0195-6698(03)00030-1_B12","first-page":"3","article-title":"Die Verzweigtheit von Graphen","volume":"16","author":"H\u00e4sselbarth","year":"1984","journal-title":"(MATCH) Comm. Math. & Computer Chem."},{"key":"10.1016\/S0195-6698(03)00030-1_B13","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0206008","article-title":"A graph-theoretic characterization of the PVchunk class of synchronizing primitives","volume":"6","author":"Henderson","year":"1977","journal-title":"SIAM. J. Comput."},{"key":"10.1016\/S0195-6698(03)00030-1_B14","series-title":"Studies on Graphs and Discrete Programming","first-page":"241","article-title":"Sufficient conditions for graphs to have threshold number 2","author":"Ibaraki","year":"1981"},{"key":"10.1016\/S0195-6698(03)00030-1_B15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0012-365X(00)00079-0","article-title":"On homotopy of connected graphs having the same degree function","volume":"230","author":"Kelmans","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/S0195-6698(03)00030-1_B16","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/sapm1975544283","article-title":"A note on unigraphic sequences","volume":"54","author":"Kleitman","year":"1975","journal-title":"Stud. Appl. Math."},{"key":"10.1016\/S0195-6698(03)00030-1_B17","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0095-8956(73)90037-3","article-title":"Extreme degree sequences of simple graphs","volume":"15","author":"Koren","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0195-6698(03)00030-1_B18","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0095-8956(75)90072-6","article-title":"Graphic sequences with unique realization","volume":"19","author":"Li","year":"1975","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0195-6698(03)00030-1_B19","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0166-218X(88)90048-0","article-title":"Strict 2-threshold graphs","volume":"21","author":"Mahadev","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0195-6698(03)00030-1_B20","series-title":"Threshold Graphs and Related Topics","author":"Mahadev","year":"1995"},{"key":"10.1016\/S0195-6698(03)00030-1_B21","series-title":"Inequalities: Theory of Majorization and Its Applications","author":"Marshall","year":"1979"},{"key":"10.1016\/S0195-6698(03)00030-1_B22","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0024-3795(94)90361-1","article-title":"Degree maximal graphs are Laplacian integral","volume":"199","author":"Merris","year":"1994","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0195-6698(03)00030-1_B23","series-title":"Proc. Prague Math. Conf.","first-page":"205","article-title":"Threshold graphs","author":"Merris","year":"1996"},{"key":"10.1016\/S0195-6698(03)00030-1_B24","series-title":"Graph Theory","author":"Merris","year":"2001"},{"key":"10.1016\/S0195-6698(03)00030-1_B25","unstructured":"R. Merris, T. Roby, The lattice of threshold graphs (manuscript)"},{"key":"10.1016\/S0195-6698(03)00030-1_B26","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0167-5060(08)70749-0","article-title":"The minimal integral separator of a threshold graph","volume":"1","author":"Orlin","year":"1977","journal-title":"Annals Disc. Math."},{"key":"10.1016\/S0195-6698(03)00030-1_B27","doi-asserted-by":"crossref","first-page":"40","DOI":"10.4153\/CJM-1968-005-0","article-title":"Enumeration of graphs with given partition","volume":"20","author":"Parthasarathy","year":"1968","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0195-6698(03)00030-1_B28","first-page":"735","article-title":"Threshold graph enumeration and series-product identities","volume":"291","author":"Peled","year":"1980","journal-title":"Congr. Numer."},{"key":"10.1016\/S0195-6698(03)00030-1_B29","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0024-3795(89)90470-9","article-title":"The polytope of degree sequences","volume":"114\u2013115","author":"Peled","year":"1989","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0195-6698(03)00030-1_B30","first-page":"285","article-title":"The branching extent of graphs","volume":"4","author":"Ruch","year":"1979","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/S0195-6698(03)00030-1_B31","series-title":"Combinatorial Mathematics","volume":"vol. 14","author":"Ryser","year":"1963"},{"key":"10.1016\/S0195-6698(03)00030-1_B32","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jgt.3190150209","article-title":"Seven criteria for sequences being graphic","volume":"15","author":"Sierksma","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0195-6698(03)00030-1_B33","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0012-365X(99)00381-7","article-title":"Decompostion of graphical sequences and unigraphs","volume":"220","author":"Tyshkevich","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0195-6698(03)00030-1_B34","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/S0895480197331156","article-title":"Switching distances between graphs with the same degree","volume":"12","author":"Will","year":"1999","journal-title":"SIAM J. Discrete Math."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669803000301?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669803000301?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:24:27Z","timestamp":1553214267000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669803000301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0195669803000301"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(03)00030-1","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}