The most general structure of graphs with Hamiltonian or Hamiltonian connected square

DOI10.1016/j.disc.2023.113702zbMath1525.05099arXiv2203.12665OpenAlexW4386940805MaRDI QIDQ6080167

Herbert Fleischner, Jan Ekstein

Publication date: 30 October 2023

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

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

zbMATH Keywords

Hamiltonian cycleHamiltonian pathsquare of a graphblock-cutvertex graph

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• A short proof of the versatile version of Fleischner's theorem
• 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
• Revisiting the Hamiltonian theme in the square of a block: the general case
• Revisiting the Hamiltonian theme in the square of a block: the case of \(DT\)-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 Total Graphs

This page was built for publication: The most general structure of graphs with Hamiltonian or Hamiltonian connected square