Maximal Hamiltonian cycles in squares of graphs

DOI10.1016/0095-8956(79)90040-6zbMath0402.05049OpenAlexW2036607488MaRDI QIDQ1255503

Arthur M. Hobbs

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(79)90040-6

zbMATH Keywords

PathSquare of a GraphMaximal Hamiltonian Cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Hamiltonian squares of cacti

Cites Work

• Unnamed Item
• Unnamed Item
• A necessary condition for the square of a graph to be Hamiltonian
• Bridges and Hamiltonian circuits in planar graphs
• Hamiltonian squares of cacti
• Hamiltonsche Linien im Quadrat brückenloser Graphen mit Artikulationen
• The square of every two-connected graph is Hamiltonian
• A Theorem on Planar Graphs

This page was built for publication: Maximal Hamiltonian cycles in squares of graphs