Hamilton cycles in line graphs of 3-hypergraphs
From MaRDI portal
Publication:2144607
Abstract: We prove that every 52-connected line graph of a rank 3 hypergraph is Hamiltonian. This is the first result of this type for hypergraphs of bounded rank other than ordinary graphs.
Recommendations
Cites work
- scientific article; zbMATH DE number 68918 (Why is no real title available?)
- A Theorem on Planar Graphs
- An approximate max-Steiner-tree-packing min-Steiner-cut theorem
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
- Graph theory
- Hamilton cycles in 5-connected line graphs
- Hamiltonian results inK1,3-free graphs
- Hamiltonicity for K1, r‐free graphs
- How many conjectures can you stand? A survey
- Not every 2-tough graph is Hamiltonian
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On a closure concept in claw-free graphs
- Packing Steiner trees
- Packing of Steiner trees and \(S\)-connectors in graphs
- Reflections on graph theory
- Thomassen's conjecture for line graphs of 3-hypergraphs
- Tough graphs and Hamiltonian circuits.
Cited in
(4)
This page was built for publication: Hamilton cycles in line graphs of 3-hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144607)