On graphs with Hamiltonian squares

DOI10.1016/0012-365X(78)90164-4zbMath0376.05037MaRDI QIDQ1245849

P. Underground

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (5)

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) ⋮ On graphs whose square have strong Hamiltonian properties ⋮ A characterization of graphs with regular distance-2 graphs

Cites Work

• Unnamed Item
• The square of every two-connected graph is Hamiltonian
• The complexity of theorem-proving procedures

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