{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:36:12Z","timestamp":1725525372307},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_15","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T02:34:01Z","timestamp":1234233241000},"page":"165-176","source":"Crossref","is-referenced-by-count":1,"title":["Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Borri","sequence":"first","affiliation":[]},{"given":"Tiziana","family":"Calamoneri","sequence":"additional","affiliation":[]},{"given":"Rossella","family":"Petreschi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"17","key":"15_CR1","doi-asserted-by":"publisher","first-page":"2445","DOI":"10.1016\/j.dam.2006.03.036","volume":"154","author":"T. Calamoneri","year":"2006","unstructured":"Calamoneri, T., Petreschi, R.: \u03bb-Coloring Matrogenic Graphs. Discrete Applied Mathematics\u00a0154(17), 2445\u20132457 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume":"1","author":"V. Chvatal","year":"1977","unstructured":"Chvatal, V., Hammer, P.: Aggregation of inequalities integer programming. Ann. Discrete Math.\u00a01, 145\u2013162 (1977)","journal-title":"Ann. Discrete Math."},{"issue":"15","key":"15_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0012-365X(96)00171-9","volume":"165-166","author":"G. Ding","year":"1997","unstructured":"Ding, G., Hammer, P.: Matroids arisen from matrogenic graphs. Discrete Mathematics\u00a0165-166(15), 211\u2013217 (1997)","journal-title":"Discrete Mathematics"},{"key":"15_CR4","unstructured":"Foldes, S., Hammer, P.: Split graphs. In: Proc. 8th South-East Conference on Combinatorics, Graph Theory and Computing, pp. 311\u2013315 (1977)"},{"key":"15_CR5","first-page":"331","volume":"18","author":"S. Foldes","year":"1978","unstructured":"Foldes, S., Hammer, P.: On a class of matroid producing graphs. Colloq. Math. Soc. J. Bolyai (Combinatorics)\u00a018, 331\u2013352 (1978)","journal-title":"Colloq. Math. Soc. J. Bolyai (Combinatorics)"},{"key":"15_CR6","first-page":"496","volume":"10","author":"S.L. Hakimi","year":"1962","unstructured":"Hakimi, S.L.: On realizability of a set of integers and the degrees of the vertices of a linear graph. J. Appl. Math.\u00a010\/ 11, 496\u2013506\/ 165\u2013147 (1962)","journal-title":"J. Appl. Math."},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.2140\/pjm.1975.56.143","volume":"56","author":"R.H. Johnson","year":"1975","unstructured":"Johnson, R.H.: Simple separable graphs. Pacific Journal Math.\u00a056(1), 143\u2013158 (1975)","journal-title":"Pacific Journal Math."},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1002\/sapm1975544283","volume":"LIV","author":"D. Kleiman","year":"1975","unstructured":"Kleiman, D., Li, S.-Y.: A Note on Unigraphic Sequences. Studies in Applied Mathematics,\u00a0LIV(4), 283\u2013287 (1975)","journal-title":"Studies in Applied Mathematics"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0095-8956(76)80007-X","volume":"21","author":"M. Koren","year":"1976","unstructured":"Koren, M.: Sequences with unique realization by simple graphs. J. of Combinatorial theory ser. B\u00a021, 235\u2013244 (1976)","journal-title":"J. of Combinatorial theory ser. B"},{"key":"15_CR10","series-title":"Ann. Discrete Math.","volume-title":"Threshold Graphs and Related Topics","author":"N.V.R. Mahadev","year":"1995","unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics. Ann. Discrete Math., vol.\u00a056. North-Holland, Amsterdam (1995)"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(84)90023-2","volume":"51","author":"P. Marchioro","year":"1984","unstructured":"Marchioro, P., Morgana, A., Petreschi, R., Simeone, B.: Degree sequences of matrogenic graphs. Discrete Math.\u00a051, 47\u201361 (1984)","journal-title":"Discrete Math."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0020-0190(00)00041-7","volume":"75","author":"S.D. Nikolopoulos","year":"2000","unstructured":"Nikolopoulos, S.D.: Recognizing Cographs And Threshold Graphs through a classification of their edges. Information Processing Letters\u00a075, 129\u2013139 (2000)","journal-title":"Information Processing Letters"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0167-5060(08)70749-0","volume":"1","author":"J.B. Orlin","year":"1977","unstructured":"Orlin, J.B.: The minimal integral separator of a threshold graph. Ann. Discrete Math.\u00a01, 415\u2013419 (1977)","journal-title":"Ann. Discrete Math."},{"key":"15_CR14","unstructured":"Suzdal, S., Tyshkevich, R.: (P,Q)-decomposition of graphs. Tech. Rep. Rostock: Univ. Fachbereich Informatik, II, 16 S (1999)"},{"key":"15_CR15","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.\u00a0220, 201\u2013238 (2000)","journal-title":"Discrete Math."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0012-365X(84)90026-8","volume":"51","author":"R. Tyshkevich","year":"1984","unstructured":"Tyshkevich, R.: Once more on matrogenic graphs. Discrete Math.\u00a051, 91\u2013100 (1984)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T02:40:53Z","timestamp":1551753653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}