3050 2022 eng 11 2 38 article Springer Science and Business Media LLC 0 -- 2025-07-16 -- Graphs and Combinatorics 0911-0119 10.1007/s00373-021-02410-w true {"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:09Z","timestamp":1740107109113,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s00373-021-02410-w","type":"journal-article","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T10:07:05Z","timestamp":1643710025000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Point Partition Numbers: Perfect Graphs"],"prefix":"10.1007","volume":"38","author":[{"given":"Justus","family":"von Postel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4969-7115","authenticated-orcid":false,"given":"Thomas","family":"Schweser","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Stiebitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,1]]},"reference":[{"key":"2410_CR1","first-page":"21","volume":"7","author":"SD Andres","year":"2012","unstructured":"Andres, S.D.: On characterizing game-perfect graphs by forbidden induced subgraphs. Contrib. Discrete Math. 7, 21\u201334 (2012)","journal-title":"Contrib. Discrete Math."},{"key":"2410_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/jgt.21811","volume":"79","author":"SD Andres","year":"2015","unstructured":"Andres, S.D., Hochst\u00e4ttler, W.: Perfect digraphs. J. Graph Theory 79, 21\u201329 (2015)","journal-title":"J. Graph Theory"},{"doi-asserted-by":"crossref","unstructured":"Bang-Jensen, J., Bellitto, T., Schweser, T., Stiebitz, M.: Haj\u00f3s and Ore construction for digraphs. Electron. J.\u00a0Combin. 27, P1.63 (2020)","key":"2410_CR3","DOI":"10.37236\/8942"},{"key":"2410_CR4","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.tcs.2012.03.017","volume":"443","author":"J Bang-Jensen","year":"2012","unstructured":"Bang-Jensen, J., Havet, F., Trotignon, N.: Finding an induced subdivision of a digraph. Theor. Comput. Sci. 443, 10\u201324 (2012)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Berge, C.: Some classes of perfect graphs. In: Six Papers on Graph Theory, Indian Statistical Institute, pp. 1\u201321. Mc Millan, Calcutta (1963)","key":"2410_CR5"},{"key":"2410_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1112\/blms\/11.2.113","volume":"11","author":"B Bollob\u00e1s","year":"1979","unstructured":"Bollob\u00e1s, B., Manvel, B.: Optimal vertex partition. Bull. Lond. Math. Soc. 11, 113\u2013116 (1979)","journal-title":"Bull. Lond. Math. Soc."},{"key":"2410_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00493-005-0012-8","volume":"25","author":"M Chudnovsky","year":"2005","unstructured":"Chudnovsky, M., Cornu\u00e9jols, G., Liu, X., Seymour, P., Vu\u0161kovi\u0107, K.: Recognizing Berge graphs. Combinatorica 25, 143\u2013186 (2005)","journal-title":"Combinatorica"},{"key":"2410_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"2410_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01844846","volume":"16","author":"GS Gasparian","year":"1996","unstructured":"Gasparian, G.S.: Minimal imperfect graphs: a simple approach. Combinatorica 16, 209\u2013212 (1996)","journal-title":"Combinatorica"},{"key":"2410_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, L.: The ellipsoid method and its consequence in combinatorial optimization. Combinatorica 1, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"2410_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization (Second corrected edition)","author":"M Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, L.: Geometric Algorithms and Combinatorial Optimization (Second corrected edition). Springer, Berlin (1993)"},{"unstructured":"Haj\u00f3s, G.: \u00dcber eine Konstruktion nicht $$n$$-f\u00e4rbbarer Graphen. Wiss. Z. Martin Luther Univ. Halle-Wittenberg Math.-Natur. Reihe 10, 116\u2013117 (1961)","key":"2410_CR12"},{"key":"2410_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.4153\/CMB-1968-023-5","volume":"11","author":"ST Hedetniemi","year":"1968","unstructured":"Hedetniemi, S.T.: On partitioning planar graphs. Can. Math. Bull. 11, 203\u2013211 (1968)","journal-title":"Can. Math. Bull."},{"key":"2410_CR14","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","volume":"22","author":"DR Lick","year":"1970","unstructured":"Lick, D.R., White, A.: $$k$$-degenerate graphs. Can. J. Math. 22, 1082\u20131096 (1970)","journal-title":"Can. J. Math."},{"key":"2410_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","volume":"13","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: A characterization of perfect graphs. J. Combin. Theory Ser. B 13, 95\u201398 (1972)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2410_CR16","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: Normal hypergraphs and the perfect graph conjecture. Discrete Math. 2, 253\u2013267 (1972)","journal-title":"Discrete Math."},{"unstructured":"von Postel, J., Schweser, T., Stiebitz, M.: Point partition number: decomposable and indecomposable critical graphs (2019). arXiv:1912.12654. Accessed 17 July 2021","key":"2410_CR17"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02410-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02410-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02410-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T14:35:20Z","timestamp":1648046120000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02410-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,1]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["2410"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02410-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,2,1]]},"assertion":[{"value":"10 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"31"}} journal-article https://www.springer.com/tdm crossref PersonAuthorFirstName_1,PersonAuthorLastName_1,PersonAuthorFirstName_2,PersonAuthorLastName_2,PersonAuthorIdentifierOrcid_2,PersonAuthorFirstName_3,PersonAuthorLastName_3,PublisherName,TitleMain_1,Language,TitleParent_1,ArticleNumber,Issue,Volume,CompletedYear,IdentifierIssn,Enrichmentlocal_crossrefLicence doi-import false false 2 Justus von Postel Thomas Schweser Michael Stiebitz