Thomassen's conjecture for line graphs of 3-hypergraphs
From MaRDI portal
Publication:2174582
DOI10.1016/j.disc.2020.111838zbMath1437.05127OpenAlexW3006611002WikidataQ122980656 ScholiaQ122980656MaRDI QIDQ2174582
Zdeněk Ryjáček, Kenta Ozeki, Petr Vrána, Bin Long Li
Publication date: 21 April 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.111838
Hypergraphs (05C65) 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
- On 1-Hamilton-connected claw-free graphs
- How many conjectures can you stand? A survey
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- On a closure concept in claw-free graphs
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Equivalence of Jackson's and Thomassen's conjectures
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
- Hamiltonian results inK1,3-free graphs
- Local Clique Covering of Claw-Free Graphs
- Reflections on graph theory
- A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Edge intersection graphs of linear 3-uniform hypergraphs