A short proof of the versatile version of Fleischner's theorem
From MaRDI portal
(Redirected from Publication:383756)
Recommendations
Cites work
- A new proof of the theorem by Fleischner
- A short proof of Fleischner's theorem
- Graph theory
- Hamiltonian cycles in the square of a graph
- 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
- On graphs whose square have strong Hamiltonian properties
- The square of every two-connected graph is Hamiltonian
Cited in
(9)- A short proof of Fleischner's theorem
- A Hamiltonian cycle in the square of a 2-connected graph in linear time
- 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)
