On graphs with Hamiltonian squares

DOI10.1016/0012-365X(78)90164-4MaRDI QIDQ1245849zbMATH OpenFDO

Authors P. Underground

Publication date 1978

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(78)90164-4

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites work

• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• The complexity of theorem-proving procedures
• The square of every two-connected graph is Hamiltonian

Cited in

(5)

• On graphs whose square have strong Hamiltonian properties
• A characterization of graphs with regular distance-2 graphs
• Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
• Connected even factors in the square of essentially 2-edge-connected graph
• Graph theory (algorithmic, algebraic, and metric problems)

This page was built for publication: On graphs with Hamiltonian squares

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