Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference15 articles.
1. Catlin, P.: Hajós’ graph-coloring conjecture: variations and counterexamples. J. Comb. Theory Ser. B 26, 268–274 (1979)
2. Dirac, G.A.: A property of 4-chromatic graphs and some remarks on critical graphs. J. Lond. Math. Soc. Ser. B 27, 85–92 (1952)
3. Erdös, P., Fajtlowicz, S.: On the conjecture of Hajós. Combinatorica 1, 141–143 (1981)
4. Kelmans, A.K.: Every minimal counterexample to the Dirac conjecture is 5-connected. Lectures to the Moscow Seminar on Discrete Mathematics, (1979)
5. Ma, J., Yu, X.: Independent paths and $$K_5$$ K 5 -subdivisions. J. Comb. Theory Ser. B 100, 600–616 (2010)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 4‐Separations in Hajós graphs;Journal of Graph Theory;2021-09-28
2. The Kelmans-Seymour conjecture IV: A proof;Journal of Combinatorial Theory, Series B;2020-09