{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:22Z","timestamp":1759638142992,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319123394"},{"type":"electronic","value":"9783319123400"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12340-0_17","type":"book-chapter","created":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T04:27:23Z","timestamp":1413779243000},"page":"201-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hadwiger Number of Graphs with Small Chordality"],"prefix":"10.1007","author":[{"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[]},{"given":"Pim","family":"van \u2019t Hof","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,21]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.tcs.2006.12.021","volume":"374","author":"N Alon","year":"2007","unstructured":"Alon, N., Lingas, A., Wahl\u00e9n, M.: Approximating the maximum clique minor and some subgraph homeomorphism problems. Theor. Comput. Sci. 374, 149\u2013158 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0195-6698(80)80001-1","volume":"1","author":"B Bollob\u00e1s","year":"1980","unstructured":"Bollob\u00e1s, B., Catlin, P.A., Erd\u00f6s, P.: Hadwiger\u2019s conjecture is true for almost every graph. Eur. J. Comb. 1, 195\u2013199 (1980)","journal-title":"Eur. J. Comb."},{"key":"17_CR3","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V., Spinrad, J.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (1999)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-03898-8_10","volume-title":"Parameterized and Exact Computation","author":"L Cai","year":"2013","unstructured":"Cai, L., Guo, C.: Contracting few edges to remove forbidden induced subgraphs. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 97\u2013109. Springer, Heidelberg (2013)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Golovach, P.A., Heggernes, P., van \u2019t Hof, P., Paul C.: Hadwiger number of graphs with small chordality. CoRR abs\/1406.3812 (2014)","DOI":"10.1007\/978-3-319-12340-0_17"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.7155\/jgaa.00183","volume":"13","author":"D Eppstein","year":"2009","unstructured":"Eppstein, D.: Finding large clique minors is hard. J. Graph Algorithms Appl. 13(2), 197\u2013204 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"17_CR7","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 57, 2nd edn. Elsevier, Amsterdam (2004)","edition":"2"},{"key":"17_CR8","first-page":"133","volume":"88","author":"H Hadwiger","year":"1943","unstructured":"Hadwiger, H.: \u00dcber eine klassifikation der streckenkomplexe. Vierteljschr. Naturforsch. Ges. Z\u00fcrich 88, 133\u2013143 (1943)","journal-title":"Vierteljschr. Naturforsch. Ges. Z\u00fcrich"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-03898-8_21","volume-title":"Parameterized and Exact Computation","author":"D Lokshtanov","year":"2013","unstructured":"Lokshtanov, D., Misra, N., Saurabh, S.: On the hardness of eliminating small induced subgraphs by contracting edges. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 243\u2013254. Springer, Heidelberg (2013)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63, 65\u2013110 (1995)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"18","author":"J Spinrad","year":"1987","unstructured":"Spinrad, J., Brandst\u00e4dt, A., Stewart, L.: Bipartite permutation graphs. Discrete Appl. Math. 18(3), 279\u2013292 (1987)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the STOC 2006, pp. 681\u2013690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12340-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T14:50:19Z","timestamp":1676904619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12340-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319123394","9783319123400"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12340-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"21 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}