Thomassen's conjecture for line graphs of 3-hypergraphs

DOI10.1016/J.DISC.2020.111838MaRDI QIDQ2174582zbMATH OpenOpenAlexWikidataFDO

Authors Kenta Ozeki, Zdeněk Ryjáček, Petr Vrána, Binlong 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

zbMATH Keywords

Hamilton-connectednesshypergraphline graphThomassen's conjectureTutte cycleTutte path

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Hamiltonicity of 3-connected line graphs
• Hamilton cycles in 5-connected line graphs
• Publication:4862240
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• A note on the shortness coefficient and the Hamiltonicity of 4-connected line graphs

Cites work

• A closure for 1-Hamilton-connectedness in claw-free graphs
• Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
• Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
• Edge intersection graphs of linear 3-uniform hypergraphs
• Equivalence of Jackson's and Thomassen's conjectures
• Eulerian subgraphs and Hamilton-connected line graphs
• Graph theory
• Hamiltonian results inK1,3-free graphs
• How many conjectures can you stand? A survey
• scientific article; zbMATH DE number 4108816 (Why is no real title available?)
• scientific article; zbMATH DE number 68918 (Why is no real title available?)
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• Local clique covering of claw-free graphs
• On 1-Hamilton-connected claw-free graphs
• On a closure concept in claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Reflections on graph theory
• Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs

Cited in

(8)

• A note on the shortness coefficient and the Hamiltonicity of 4-connected line graphs
• Hamilton cycles in line graphs of 3-hypergraphs
• Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
• A relationship between Thomassen's conjecture and Bondy's conjecture
• scientific article; zbMATH DE number 842020 (Why is no real title available?)
• On hamiltonian line graphs of hypergraphs
• On k-edge-Hamilton-connected line graphs
• Hamiltonicity of 3-connected line graphs

This page was built for publication: Thomassen's conjecture for line graphs of 3-hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174582)