Hamilton cycles in line graphs of 3-hypergraphs

DOI10.1016/j.disc.2022.113028zbMath1491.05119arXiv2201.13115OpenAlexW4281999288MaRDI QIDQ2144607

Petr Vrána, Tomáš Kaiser

Publication date: 14 June 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.13115

zbMATH Keywords

line graphHamilton cycle3-hypergraph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Packing Steiner trees
• Hamilton cycles in 5-connected line graphs
• How many conjectures can you stand? A survey
• Packing of Steiner trees and \(S\)-connectors in graphs
• An approximate max-Steiner-tree-packing min-Steiner-cut theorem
• On a closure concept in claw-free graphs
• Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
• Not every 2-tough graph is Hamiltonian
• Thomassen's conjecture for line graphs of 3-hypergraphs
• Tough graphs and Hamiltonian circuits.
• A Theorem on Planar Graphs
• Hamiltonian results inK1,3-free graphs
• Reflections on graph theory
• Hamiltonicity for K_{1, r}‐free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs