A short proof of the versatile version of Fleischner's theorem

DOI10.1016/j.disc.2012.07.032zbMath1277.05102OpenAlexW2052546202MaRDI QIDQ383756

Janina Müttel, Dieter Rautenbach

Publication date: 6 December 2013

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.07.032

zbMATH Keywords

Hamiltonian cyclesquare of a graphFleischner's theorem

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Connected even factors in the square of essentially 2-edge-connected graph ⋮ The most general structure of graphs with Hamiltonian or Hamiltonian connected square ⋮ A best possible result for the square of a 2-block to be Hamiltonian ⋮ Disjoint path covers in cubes of connected graphs ⋮ Graphs whose complement and square are isomorphic ⋮ Spanning connectivity of the power of a graph and Hamilton-connected index of a graph ⋮ A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph

Cites Work

• Unnamed Item
• Hamiltonian cycles in the square of a graph
• On graphs whose square have strong Hamiltonian properties
• A short proof of Fleischner's theorem
• A new proof of the theorem by Fleischner
• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• Induced \(S(K_{1,3})\) and hamiltonian cycles in the square of a graph
• The square of every two-connected graph is Hamiltonian

This page was built for publication: A short proof of the versatile version of Fleischner's theorem