Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference22 articles.
1. Hajós' graph-coloring conjecture: variations and counterexamples;Catlin;J. Combin. Theory Ser. B,1979
2. Covering three edges with a bond in a nonseparable graph;Chakravarti,1979
3. Graph connectivity after path removal;Chen;Combinatorica,2003
4. Non-separating cycles in 4-connected graphs;Curran;SIAM J. Discrete Math.,2003
5. Graph Theory;Diestel,2006
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 4‐Separations in Hajós graphs;Journal of Graph Theory;2021-09-28
2. Wheels in planar graphs and Hajós graphs;Journal of Graph Theory;2021-06-08
3. Rooted topological minors on four vertices;Journal of Combinatorial Theory, Series B;2021-06
4. The Kelmans-Seymour conjecture IV: A proof;Journal of Combinatorial Theory, Series B;2020-09
5. The Kelmans-Seymour conjecture III: 3-vertices in K4−;Journal of Combinatorial Theory, Series B;2020-09