{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:44Z","timestamp":1740107144991,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T00:00:00Z","timestamp":1532390400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s00373-018-1925-5","type":"journal-article","created":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T04:48:14Z","timestamp":1532407694000},"page":"989-999","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Structure of (Even Hole, Kite)-Free Graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Dallas J.","family":"Fraser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ang\u00e8le M.","family":"Hamel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ch\u00ednh T.","family":"Ho\u00e0ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"key":"1925_CR1","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1016\/j.jctb.2007.12.006","volume":"98","author":"L Addario-Berry","year":"2008","unstructured":"Addario-Berry, L., Chudnovsky, M., Havet, F., Reed, B., Seymour, P.: Bisimplicial vertices in even-hole-free graphs. J. Comb. Theory Ser. B 98, 1119\u20131164 (2008)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1925_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/B:ANOR.0000032574.01332.98","volume":"130","author":"N Barnier","year":"2004","unstructured":"Barnier, N., Brisset, P.: Graph coloring for air traffic flow management. Ann. Oper. Res. 130, 163\u2013178 (2004)","journal-title":"Ann. Oper. Res."},{"volume-title":"Topics on Perfect Graphs","year":"1984","key":"1925_CR3","unstructured":"Berge, C., Chv\u00e1tal, V. (eds.): Topics on Perfect Graphs. North-Holland, Amsterdam (1984)"},{"key":"1925_CR4","unstructured":"Cameron, K., Chaplick, S., Ho\u00e0ng, C.T.: On the structure of (pan, even hole)-free graphs. August 12 (2015). \n                    arXiv:1508.03062"},{"key":"1925_CR5","doi-asserted-by":"crossref","unstructured":"Chang, H.-C., Lu, H.I.: A faster algorithm to recognize even-hole-free graphs. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 1286\u20131297 (2012)","DOI":"10.1137\/1.9781611973099.101"},{"key":"1925_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1002\/jgt.20040","volume":"48","author":"M Chudnovsky","year":"2005","unstructured":"Chudnovsky, M., Kawarabayashi, K., Seymour, P.: Detecting even holes. J. Graph Theory 48, 85\u2013111 (2005)","journal-title":"J. Graph Theory"},{"key":"1925_CR7","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1002\/jgt.10006","volume":"39","author":"M Conforti","year":"2002","unstructured":"Conforti, M., Cornu\u00e9jols, G., Kapoor, A., Vu\u0161kovi\u0107, K.: Even-hole-free graphs, part I: decomposition theorem. J. Graph Theory 39, 6\u201349 (2002)","journal-title":"J. Graph Theory"},{"key":"1925_CR8","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1002\/jgt.10045","volume":"40","author":"M Conforti","year":"2002","unstructured":"Conforti, M., Cornu\u00e9jols, G., Kapoor, A., Vu\u0161kovi\u0107, K.: Even-hole-free graphs, part II: recognition algorithm. J. Graph Theory 40, 238\u2013266 (2002)","journal-title":"J. Graph Theory"},{"key":"1925_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0012-365X(99)00240-X","volume":"216","author":"CMH Figueiredo de","year":"2000","unstructured":"de Figueiredo, C.M.H., Vu\u0161kovi\u0107, K.: A class of \n                    \n                      \n                    \n                    $$\\beta $$\n                    \n                      \n                        \u03b2\n                      \n                    \n                   perfect graphs. Discrete Math. 216, 169\u2013193 (2000)","journal-title":"Discrete Math."},{"key":"1925_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.7151\/dmgt.1158","volume":"22","author":"A Eisenbl\u00e4tter","year":"2002","unstructured":"Eisenbl\u00e4tter, A., Gr\u00f6tschel, M., Koster, A.M.C.A.: Frequency planning and ramifications of coloring. Discuss. Math. Graph Theory 22, 51\u201388 (2002)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1925_CR11","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"1925_CR12","unstructured":"Huang, S., da Silva, M.V.G.: A note on coloring (even-hole, cap)-free graphs October 30 (2015). \n                    arXiv:1510.09192"},{"key":"1925_CR13","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/j.jctb.2008.12.005","volume":"99","author":"T Kloks","year":"2009","unstructured":"Kloks, T., M\u00fclcer, H., Vu\u0161kovi\u0107, K.: Even-hole-free graphs that do not contain diamonds: a structure theorem and its consequences. J. Combin. Theory B 99, 733\u2013800 (2009)","journal-title":"J. Combin. Theory B"},{"key":"1925_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1996.0030","volume":"67","author":"SE Markossian","year":"1996","unstructured":"Markossian, S.E., Gasparian, G.S., Reed, B.A.: \n                    \n                      \n                    \n                    $$\\beta $$\n                    \n                      \n                        \u03b2\n                      \n                    \n                  -Perfect graphs. J. Combin. Theory Ser. B 67, 1\u201311 (1996)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1925_CR15","first-page":"11","volume":"48","author":"D Marx","year":"2004","unstructured":"Marx, D.: Graph Coloring problems and their applications in scheduling. Period. Polytech. Electr. Eng. 48, 11\u201316 (2004)","journal-title":"Period. Polytech. Electr. Eng."},{"key":"1925_CR16","unstructured":"Narayanan, L.: Channel assignment and graph multicoloring. In: Stojmenovi\u0107, I. (ed.) Handbook of wireless networks and mobile computing, pp. 71\u201394. Wiley (2002). ISBN 9780471419020"},{"key":"1925_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"RE Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Decomposition by clique separators. Discrete Math. 55, 221\u2013232 (1985)","journal-title":"Discrete Math."},{"key":"1925_CR18","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of p-graphs. Diskretn. Anal. 3, 25\u201330 (1964). (in Russian)","journal-title":"Diskretn. Anal."},{"key":"1925_CR19","unstructured":"Whitesides, S. H.: A method for solving certain graph recognition and optimization problems, with applications to perfect graphs, in [3]"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1925-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1925-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1925-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T23:39:15Z","timestamp":1569195555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1925-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,24]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1925"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1925-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,7,24]]},"assertion":[{"value":"14 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}