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 G may have in order to guarantee that G2 is hamiltonian, hamiltonian connected, respectively. Such an approach was already developed for hamiltonian total graphs.












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)