{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:07:49Z","timestamp":1775052469211,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,9,24]],"date-time":"2018-09-24T00:00:00Z","timestamp":1537747200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00373-018-1953-1","type":"journal-article","created":{"date-parts":[[2018,9,23]],"date-time":"2018-09-23T22:42:47Z","timestamp":1537742567000},"page":"1411-1427","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Adjacency Relationships Forced by a Degree Sequence"],"prefix":"10.1007","volume":"34","author":[{"given":"Michael D.","family":"Barrus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,24]]},"reference":[{"issue":"1","key":"1953_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.disc.2017.08.027","volume":"341","author":"MD Barrus","year":"2018","unstructured":"Barrus, M.D., Donovan, E.: Neighborhood degree lists of graphs. Discrete Math. 341(1), 175\u2013183 (2018)","journal-title":"Discrete Math."},{"issue":"21","key":"1953_CR2","doi-asserted-by":"publisher","first-page":"2469","DOI":"10.1016\/j.disc.2013.07.010","volume":"313","author":"MD Barrus","year":"2013","unstructured":"Barrus, M.D.: Hereditary unigraphs and Erd\u0151s-Gallai equalities. Discrete Math. 313(21), 2469\u20132481 (2013)","journal-title":"Discrete Math."},{"key":"1953_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-014-1465-6","volume":"31","author":"D Bauer","year":"2015","unstructured":"Bauer, D., Broersma, H.J., van den Heuvel, J., Kahl, N., Nevo, A., Schmeichel, E., Woodall, D.R., Yatauro, M.: Best monotone degree conditions for graph properties: a survey. Graphs Combin. 31, 1\u201322 (2015)","journal-title":"Graphs Combin."},{"issue":"3","key":"1953_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0012-365X(73)90094-0","volume":"6","author":"T Brylawski","year":"1973","unstructured":"Brylawski, T.: The lattice of integer partitions. Discrete Math. 6(3), 201\u2013219 (1973)","journal-title":"Discrete Math."},{"key":"1953_CR5","unstructured":"Chv\u00e1tal, V., Hammer, P.L.: Set-packing and threshold graphs, Research Report, Comp. Sci. Dept. University of Waterloo, Canada CORR, pp. 73\u201321. (1973)"},{"key":"1953_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume-title":"Studies in Integer Programming","author":"V\u00e1clav Chv\u00e1tal","year":"1977","unstructured":"Chv\u00e1tal, V., Hammer, P.L.:Aggregation of inequalities in integer programming. In: Hammer, P.L., Johnson, E.L., Korte, B.H., Nemhauser, G.L. (eds.) Studies in Integer Programming, pp. 145\u2013162. North-Holland, New York, Annals of Discrete Mathematics, vol. 1 (1977)"},{"key":"1953_CR7","first-page":"264","volume":"11","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Gallai, T.: Graphen mit Punkten vorgeschriebenen Grades. Math. Lapok. 11, 264\u2013272 (1960)","journal-title":"Math. Lapok."},{"key":"1953_CR8","first-page":"166177","volume":"17","author":"DR Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Hoffman, A.J., McAndrew, M.H.: Some properties of graphs with multiple edges. Can. J. Math. 17, 166177 (1965)","journal-title":"Can. J. Math."},{"key":"1953_CR9","first-page":"329","volume":"21","author":"PL Hammer","year":"1978","unstructured":"Hammer, P.L., Ibaraki, T., Simeone, B.: Degree sequences of threshold graphs. Congres. Numer. 21, 329\u2013355 (1978)","journal-title":"Congres. Numer."},{"key":"1953_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1137\/0602006","volume":"2","author":"PL Hammer","year":"1981","unstructured":"Hammer, P.L., Ibaraki, T., Simeone, B.: Threshold sequences. SIAM J. Algebr. Discrete Methods 2, 39\u201349 (1981)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"1953_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579333","volume":"1","author":"PL Hammer","year":"1981","unstructured":"Hammer, P.L., Simeone, B.: The splittance of a graph. Combinatorica 1, 275\u2013284 (1981)","journal-title":"Combinatorica"},{"key":"1953_CR12","first-page":"56","volume-title":"Threshold Graphs and Related Topics. Annals of Discrete Mathematics","author":"NVR Mahadev","year":"1995","unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics. Annals of Discrete Mathematics, p. 56. North-Holland Publishing Co., Amsterdam (1995)"},{"issue":"4","key":"1953_CR13","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0195-6698(03)00030-1","volume":"24","author":"R Merris","year":"2003","unstructured":"Merris, R.: Split graphs. Eur. J. Combin. 24(4), 413\u2013430 (2003)","journal-title":"Eur. J. Combin."},{"key":"1953_CR14","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1017\/S001309150003460X","volume":"21","author":"RF Muirhead","year":"1903","unstructured":"Muirhead, R.F.: Some methods applicable to identities and inequalities of symmetric algebraic functions on \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                   letters. Proc. Edinb. Math. Soc. 21, 144\u2013157 (1903)","journal-title":"Proc. Edinb. Math. Soc."},{"issue":"115","key":"1953_CR15","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/0024-3795(89)90470-9","volume":"114","author":"UN Peled","year":"1989","unstructured":"Peled, U.N., Srinivasan, M.K.: The polytope of degree sequences. Linear Algebra Appl. 114(115), 349\u2013377 (1989)","journal-title":"Linear Algebra Appl."},{"key":"1953_CR16","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/BFb0092288","volume-title":"Combinatorics and Graph Theory","author":"S. B. Rao","year":"1981","unstructured":"Rao, S.B.: A survey of the theory of potentially \n                    \n                      \n                    \n                    $$P$$\n                    \n                      \n                        P\n                      \n                    \n                  -graphic and forcibly \n                    \n                      \n                    \n                    $$P$$\n                    \n                      \n                        P\n                      \n                    \n                  -graphic degree sequences. In: Combinatorics and graph theory (Calcutta, 1980), pp. 417\u2013440, Lecture Notes in Math., vol. 885, Springer, Berlin, New York (1981)"},{"key":"1953_CR17","first-page":"677","volume":"24","author":"RI Tyshkevich","year":"1980","unstructured":"Tyshkevich, R.I.: The canonical decomposition of a graph, Doklady Akad. Nauk BSSR 24, 677\u2013679 (1980). (in Russian)","journal-title":"Nauk BSSR"},{"issue":"1\u20133","key":"1953_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0012-365X(99)00381-7","volume":"220","author":"R Tyshkevich","year":"2000","unstructured":"Tyshkevich, R.: Decomposition of graphical sequences and unigraphs. Discrete Math. 220(1\u20133), 201\u2013238 (2000)","journal-title":"Discrete Math."},{"key":"1953_CR19","first-page":"5","volume":"6","author":"RI Tyshkevich","year":"1981","unstructured":"Tyshkevich, R.I., Melnikow, O.I., Kotov, V.M.: On graphs and degree sequences: the canonical decomposition. Kibernetica 6, 5\u20138 (1981). (in Russian)","journal-title":"Kibernetica"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1953-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1953-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1953-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T19:16:31Z","timestamp":1569266191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1953-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,24]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1953"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1953-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,24]]},"assertion":[{"value":"30 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}