Maximal Hamiltonian cycles in squares of graphs

DOI10.1016/0095-8956(79)90040-6MaRDI QIDQ1255503zbMATH OpenOpenAlexFDO

Authors 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

Maximal Hamiltonian CyclePathSquare of a Graph

Mathematics Subject Classification ID

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

Cites work

• A necessary condition for the square of a graph to be Hamiltonian
• A Theorem on Planar Graphs
• Bridges and Hamiltonian circuits in planar graphs
• Hamiltonian squares of cacti
• Hamiltonsche Linien im Quadrat brückenloser Graphen mit Artikulationen
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• scientific article; zbMATH DE number 3377257 (Why is no real title available?)
• The square of every two-connected graph is Hamiltonian

Cited in

(1)

• Hamiltonian squares of cacti

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1255503)