Equivalence of Jackson's and Thomassen's conjectures
From MaRDI portal
Publication:2349510
DOI10.1016/j.jctb.2015.04.001zbMath1315.05119OpenAlexW2029848773MaRDI QIDQ2349510
Kiyoshi Yoshimoto, Kenta Ozeki, Shuya Chiba, Roman Čada, Petr Vrána
Publication date: 22 June 2015
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2015.04.001
Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamilton cycles in 5-connected line graphs
- How many conjectures can you stand? A survey
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs
- 4-connected projective planar graphs are Hamiltonian
- Claw-free graphs---a survey
- On a closure concept in claw-free graphs
- Equivalence of Fleischner's and Thomassen's conjectures
- Hamilton paths in toroidal graphs
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- Disjoint paths, planarizing cycles, and spanning walks
- A Theorem on Planar Graphs
- Hamiltonian results inK1,3-free graphs
- Reflections on graph theory
- On Eulerian and Hamiltonian Graphs and Line Graphs
- A theorem on paths in planar graphs
- Stable dominating circuits in snarks
