{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:18:04Z","timestamp":1758824284969,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T00:00:00Z","timestamp":1549497600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["327533333"],"award-info":[{"award-number":["327533333"]}],"id":[{"id":"10.13039\/501100001659","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":[[2019,3]]},"DOI":"10.1007\/s00373-019-02012-7","type":"journal-article","created":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T01:17:27Z","timestamp":1549502247000},"page":"551-557","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Rooted Complete Minors in Line Graphs with a Kempe Coloring"],"prefix":"10.1007","volume":"35","author":[{"given":"Matthias","family":"Kriesell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Mohr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,7]]},"reference":[{"key":"2012_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory, 5th edn. Springer, Berlin (2017)","edition":"5"},{"key":"2012_CR2","first-page":"133","volume":"88","author":"H Hadwiger","year":"1943","unstructured":"Hadwiger, H.: \u00dcber eine klassifikation der streckenkomplexe. Vierteljahresschr. Naturforsch. Ges. Z\u00fcrich 88, 133\u2013142 (1943)","journal-title":"Vierteljahresschr. Naturforsch. Ges. Z\u00fcrich"},{"key":"2012_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/jgt.22056","volume":"85","author":"M Kriesell","year":"2017","unstructured":"Kriesell, M.: Unique colorability and clique minors. J. Graph Theory 85, 207\u2013216 (2017)","journal-title":"J. Graph Theory"},{"key":"2012_CR4","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1002\/1097-0118(200101)36:1<52::AID-JGT5>3.0.CO;2-N","volume":"36","author":"M Kriesell","year":"2001","unstructured":"Kriesell, M.: Induced paths in 5-connected graphs. J. Graph Theory 36, 52\u201358 (2001)","journal-title":"J. Graph Theory"},{"key":"2012_CR5","unstructured":"Kotzig, A.: Hamilton graphs and Hamilton circuits. Theory of graphs and its applications (Proc. Sympos. Smolenice, 1963), pp. 63\u201382"},{"key":"2012_CR6","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.ejc.2003.09.020","volume":"25","author":"B Reed","year":"2004","unstructured":"Reed, B., Seymour, P.: Hadwiger\u2019s conjecture for line graphs. Eur. J. Comb. 25, 873\u20136 (2004)","journal-title":"Eur. J. Comb."},{"key":"2012_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01202354","volume":"13","author":"N Robertson","year":"1993","unstructured":"Robertson, N., Seymour, P., Thomas, R.: Hadwiger\u2019s conjecture for K6-free graphs. Combinatorica 13, 279\u2013361 (1993)","journal-title":"Combinatorica"},{"key":"2012_CR8","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-319-32162-2_13","volume-title":"Hadwiger\u2019s Conjecture, Open Problems in Mathematics","author":"P Seymour","year":"2016","unstructured":"Seymour, P.: Hadwiger\u2019s Conjecture, Open Problems in Mathematics, pp. 417\u2013437. Springer, Cham (2016)"},{"key":"2012_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0167-5060(08)70511-9","volume":"3","author":"AG Thomason","year":"1978","unstructured":"Thomason, A.G.: Hamiltonian cycles and uniquely edge colourable graphs. Ann. Discrete Math. 3, 259\u2013268 (1978)","journal-title":"Ann. Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02012-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02012-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02012-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,6]],"date-time":"2020-02-06T19:25:23Z","timestamp":1581017123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02012-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,7]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["2012"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02012-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,2,7]]},"assertion":[{"value":"19 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}