{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:42Z","timestamp":1740107142965,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T00:00:00Z","timestamp":1513900800000},"content-version":"unspecified","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,1]]},"DOI":"10.1007\/s00373-017-1868-2","type":"journal-article","created":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T08:51:49Z","timestamp":1513932709000},"page":"139-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Normal Graph Conjecture for Two Classes of Sparse Graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Anne","family":"Berry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6055-1176","authenticated-orcid":false,"given":"Annegret K.","family":"Wagler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"key":"1868_CR1","first-page":"114","volume":"10","author":"C Berge","year":"1961","unstructured":"Berge, C.: F\u00e4rbungen von Graphen, deren s\u00e4mtliche bzw. deren ungerade Kreise starr sind. Wiss.\u00a0Zeitschrift der Martin-Luther-Universit\u00e4t Halle-Wittenberg 10, 114\u2013115 (1961)","journal-title":"Wiss.\u00a0Zeitschrift der Martin-Luther-Universit\u00e4t Halle-Wittenberg"},{"key":"1868_CR2","doi-asserted-by":"crossref","unstructured":"Berry, A., Wagler, A.K.: The normal graph conjecture for classes of sparse graphs. Lect. Notes Comput. Sci. 8165, 64\u201375 (2013) (Special Issue WG 2013)","DOI":"10.1007\/978-3-642-45043-3_7"},{"key":"1868_CR3","doi-asserted-by":"crossref","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":"1868_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02122693","volume":"10","author":"I Czisz\u00e1r","year":"1990","unstructured":"Czisz\u00e1r, I., K\u00f6rner, J., Lov\u00e1sz, L., Marton, K., Simonyi, G.: Entropy splitting for antiblocking corners and perfect graphs. Combinatorica 10, 27\u201340 (1990)","journal-title":"Combinatorica"},{"key":"1868_CR5","unstructured":"Harutyunyan, A., Pastor, L., Thomass\u00e9, S.: Disproving the normal graph conjecture. \n                        arXiv:1508.05487v5\n                        \n                     [math.CO]"},{"key":"1868_CR6","first-page":"405","volume":"8","author":"J K\u00f6rner","year":"1973","unstructured":"K\u00f6rner, J.: An extension of the class of perfect graphs. Stud. Math. Hung. 8, 405\u2013409 (1973)","journal-title":"Stud. Math. Hung."},{"key":"1868_CR7","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1109\/TIT.1973.1055109","volume":"19","author":"J K\u00f6rner","year":"1973","unstructured":"K\u00f6rner, J., Longo, G.: Two-step encoding of finite memoryless sources. IEEE Trans. Inform. Theory 19, 778\u2013782 (1973)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1868_CR8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1137\/0401008","volume":"1","author":"J K\u00f6rner","year":"1988","unstructured":"K\u00f6rner, J., Marton, K.: Graphs that split entropies. SIAM J. Discrete Math. 1, 71\u201379 (1988)","journal-title":"SIAM J. Discrete Math."},{"key":"1868_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0166-218X(99)00018-9","volume":"94","author":"J K\u00f6rner","year":"1999","unstructured":"K\u00f6rner, J., de Simone, C.: On the odd cycles of normal graphs. Discrete Appl. Math. 94, 161\u2013169 (1999)","journal-title":"Discrete Appl. Math."},{"key":"1868_CR10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1017\/S0963548300000079","volume":"1","author":"HJ Pr\u00f6mel","year":"1992","unstructured":"Pr\u00f6mel, H.J., Steger, A.: Almost all Berge graphs are perfect. Comb. Probab. Comput. 1, 53\u201379 (1992)","journal-title":"Comb. Probab. Comput."},{"key":"1868_CR11","unstructured":"Sch\u00fclzke, H.O.: The Normal Graph Conjecture for line graphs. Diplomarbeit, TU Berlin (2006)"},{"key":"1868_CR12","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5, 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"1868_CR13","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","volume":"2","author":"CE Shannon","year":"1956","unstructured":"Shannon, C.E.: The zero-error capacity of a noisy channel. IRE Trans. Inform. Theory 2, 8\u201319 (1956)","journal-title":"IRE Trans. Inform. Theory"},{"key":"1868_CR14","first-page":"293","volume-title":"Perfect Graphs","author":"G Simonyi","year":"2001","unstructured":"Simonyi, G.: Perfect Graphs and Graph Entropy: An Updated Survey. In: Ramirez-Alfonsin, J.L., Reed, B.A. (eds.) Perfect Graphs, pp. 293\u2013328. Wiley, New York (2001)"},{"key":"1868_CR15","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/978-3-7643-7400-6_29","volume-title":"Graph Theory in Paris, Trends in Mathematics","author":"AK Wagler","year":"2007","unstructured":"Wagler, A.K.: The Normal Graph Conjecture is true for circulants. In: Bondy, A., et al. (eds.) Graph Theory in Paris, Trends in Mathematics, pp. 365\u2013374. Birkh\u00e4user, Basel (2007)"},{"key":"1868_CR16","doi-asserted-by":"crossref","first-page":"3329","DOI":"10.1016\/j.dam.2008.05.021","volume":"156","author":"AK Wagler","year":"2008","unstructured":"Wagler, A.K.: Constructions for normal graphs and some consequences. Discrete Appl. Math. 156, 3329\u20133338 (2008)","journal-title":"Discrete Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1868-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1868-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1868-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T12:07:27Z","timestamp":1517832447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1868-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,22]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["1868"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1868-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,12,22]]}}}