The most general structure of graphs with Hamiltonian or Hamiltonian connected square
From MaRDI portal
(Redirected from Publication:6080167)
Abstract: On the basis of recent results on hamiltonicity and hamiltonian connectedness in the square of a 2-block, we determine the most general block-cutvertex structure a graph may have in order to guarantee that is hamiltonian, hamiltonian connected, respectively. Such an approach was already developed for hamiltonian total graphs.
Recommendations
Cites work
- A Hamiltonian cycle in the square of a 2-connected graph in linear time
- A new proof of the theorem by Fleischner
- A short proof of Fleischner's theorem
- A short proof of the versatile version of Fleischner's theorem
- Graph theory
- Hamiltonian Total Graphs
- In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
- On graphs whose square have strong Hamiltonian properties
- On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
- Revisiting the Hamiltonian theme in the square of a block: the case of DT-graphs
- Revisiting the Hamiltonian theme in the square of a block: the general case
- The square of every two-connected graph is Hamiltonian
This page was built for publication: The most general structure of graphs with Hamiltonian or Hamiltonian connected square
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080167)