{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T00:32:45Z","timestamp":1693009965575},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,2,21]],"date-time":"2015-02-21T00:00:00Z","timestamp":1424476800000},"content-version":"tdm","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":[[2016,1]]},"DOI":"10.1007\/s00373-015-1539-0","type":"journal-article","created":{"date-parts":[[2015,2,20]],"date-time":"2015-02-20T06:24:46Z","timestamp":1424413486000},"page":"351-361","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On a Coloring Conjecture of Haj\u00f3s"],"prefix":"10.1007","volume":"32","author":[{"given":"Yuqin","family":"Sun","sequence":"first","affiliation":[]},{"given":"Xingxing","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,21]]},"reference":[{"key":"1539_CR1","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/0095-8956(79)90062-5","volume":"26","author":"P Catlin","year":"1979","unstructured":"Catlin, P.: Haj\u00f3s\u2019 graph-coloring conjecture: variations and counterexamples. J. Comb. Theory Ser. B 26, 268\u2013274 (1979)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1539_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-27.1.85","volume":"27","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: A property of 4-chromatic graphs and some remarks on critical graphs. J. Lond. Math. Soc. Ser. B 27, 85\u201392 (1952)","journal-title":"J. Lond. Math. Soc. Ser. B"},{"key":"1539_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02579269","volume":"1","author":"P Erd\u00f6s","year":"1981","unstructured":"Erd\u00f6s, P., Fajtlowicz, S.: On the conjecture of Haj\u00f3s. Combinatorica 1, 141\u2013143 (1981)","journal-title":"Combinatorica"},{"key":"1539_CR4","unstructured":"Kelmans, A.K.: Every minimal counterexample to the Dirac conjecture is 5-connected. Lectures to the Moscow Seminar on Discrete Mathematics, (1979)"},{"key":"1539_CR5","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.jctb.2010.05.002","volume":"100","author":"J Ma","year":"2010","unstructured":"Ma, J., Yu, X.: Independent paths and $$K_5$$ K 5 -subdivisions. J. Comb. Theory Ser. B 100, 600\u2013616 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1539_CR6","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1016\/j.jctb.2013.09.006","volume":"103","author":"J Ma","year":"2013","unstructured":"Ma, J., Yu, X.: $$K_5$$ K 5 -Subdivisions in graphs containing $$K_4^-$$ K 4 - . J. Comb. Theory Ser. B 103, 713\u2013732 (2013)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1539_CR7","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s004930050041","volume":"18","author":"W Mader","year":"1998","unstructured":"Mader, W.: $$3n-5$$ 3 n - 5 Edges do force a subdivision of $$K_5$$ K 5 . Combinatorica 18, 569\u2013595 (1998)","journal-title":"Combinatorica"},{"key":"1539_CR8","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0022-247X(68)90163-7","volume":"22","author":"H Perfect","year":"1968","unstructured":"Perfect, H.: Applications of Menger\u2019s graph theorem. J. Math. Anal. Appl. 22, 96\u2013111 (1968)","journal-title":"J. Math. Anal. Appl."},{"key":"1539_CR9","doi-asserted-by":"crossref","unstructured":"Robertson, N., Chakravarti, K.: Covering three edges with a bond in a nonseparable graph. In: Deza, M., Rosenberg, G. (eds.) Combinatorics 79 Part I. Annals of discrete mathematics, p. 247 (1980)","DOI":"10.1016\/S0167-5060(08)70882-3"},{"key":"1539_CR10","unstructured":"Seymour, P.D.: Private communication"},{"key":"1539_CR11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","volume":"29","author":"PD Seymour","year":"1980","unstructured":"Seymour, P.D.: Disjoint paths in graphs. Discret. Math. 29, 293\u2013309 (1980)","journal-title":"Discret. Math."},{"key":"1539_CR12","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1145\/322203.322207","volume":"27","author":"Y Shiloach","year":"1980","unstructured":"Shiloach, Y.: A polynomial solution to the undirected two paths problem. J. Assoc. Comp. Mach. 27, 445\u2013456 (1980)","journal-title":"J. Assoc. Comp. Mach."},{"key":"1539_CR13","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0195-6698(80)80039-4","volume":"1","author":"C Thomassen","year":"1980","unstructured":"Thomassen, C.: 2-Linked graphs. Eur. J. Comb. 1, 371\u2013378 (1980)","journal-title":"Eur. J. Comb."},{"key":"1539_CR14","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.4153\/CJM-1967-121-2","volume":"19","author":"ME Watkins","year":"1967","unstructured":"Watkins, M.E., Mesner, D.M.: Cycles and connectivity in graphs. Can. J. Math. 19, 1319\u20131328 (1967)","journal-title":"Can. J. Math."},{"key":"1539_CR15","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/j.jctb.2005.10.001","volume":"96","author":"X Yu","year":"2006","unstructured":"Yu, X., Zickfeld, F.: Reducing Hajos\u2019 coloring conjecture to 4-connected graphs. J. Comb. Theory Ser. B 96, 482\u2013492 (2006)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1539-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1539-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1539-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:39Z","timestamp":1559055579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1539-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,21]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["1539"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1539-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,21]]}}}