A short proof of Fleischner's theorem

DOI10.1016/j.disc.2009.06.024zbMath1210.05122arXiv1206.6605OpenAlexW2062112275MaRDI QIDQ1045203

Angelos Georgakopoulos

Publication date: 15 December 2009

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

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

zbMATH Keywords

Hamilton cycleFleischner's theorem

Mathematics Subject Classification ID

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

Related Items

Dirac's Condition for Completely Independent Spanning Trees ⋮ A short proof of the versatile version of Fleischner's theorem ⋮ The most general structure of graphs with Hamiltonian or Hamiltonian connected square ⋮ Single-source three-disjoint path covers in cubes of connected graphs ⋮ A best possible result for the square of a 2-block to be Hamiltonian ⋮ Disjoint path covers in cubes of connected graphs ⋮ 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 ⋮ Infinite Hamilton cycles in squares of locally finite graphs

Cites Work

• Unnamed Item
• Infinite highly connected planar graphs of large girth
• A new proof of the theorem by Fleischner
• Infinite Hamilton cycles in squares of locally finite graphs
• 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
• The Cycle Space of an Infinite Graph