A new proof of the theorem by Fleischner
From MaRDI portal
Publication:1179471
DOI10.1016/0095-8956(91)90098-5zbMath0759.05061OpenAlexW2137573762MaRDI QIDQ1179471
Publication date: 26 June 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(91)90098-5
Related Items (7)
A short proof of the versatile version of Fleischner's theorem ⋮ The most general structure of graphs with Hamiltonian or Hamiltonian connected square ⋮ Spanning connectivity of the power of a graph and Hamilton-connected index of a graph ⋮ Infinite Hamilton cycles in squares of locally finite graphs ⋮ A short proof of Fleischner's theorem ⋮ The connectivity of acyclic orientation graphs ⋮ Triangle-factors in powers of graphs
Cites Work
- In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
- The square of a block is Hamiltonian connected
- On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
- The square of every two-connected graph is Hamiltonian
- Hamiltonian Paths in Squares of Infinite Locally Finite Blocks
This page was built for publication: A new proof of the theorem by Fleischner
