A short proof of the versatile version of Fleischner's theorem
From MaRDI portal
Publication:383756
DOI10.1016/J.DISC.2012.07.032zbMATH Open1277.05102OpenAlexW2052546202MaRDI QIDQ383756FDOQ383756
Authors: 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
Recommendations
Cites Work
- Graph theory
- The square of every two-connected graph is Hamiltonian
- 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
- Hamiltonian cycles in the square of a graph
Cited In (9)
- A Hamiltonian cycle in the square of a 2-connected graph in linear time
- A short proof of Fleischner's theorem
- A best possible result for the square of a 2-block to be Hamiltonian
- A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
- Disjoint path covers in cubes of connected graphs
- 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
- Connected even factors in the square of essentially 2-edge-connected graph
- Graphs whose complement and square are isomorphic
This page was built for publication: A short proof of the versatile version of Fleischner's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383756)
