Contraction theorems in Hamiltonian graph theory

DOI10.1016/0012-365X(81)90022-4zbMath0448.05045MaRDI QIDQ1146694

Cornelis Hoede, Henk Jan Veldman

Publication date: 1981

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

zbMATH Keywords

chvatal erdoes theoremcontractibility of nonhamiltonian graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

The complexity of contracting bipartite graphs into small cycles ⋮ The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases ⋮ On graph contractions and induced minors ⋮ Contraction theorems in Hamiltonian graph theory ⋮ Contracting to a longest path in H-free graphs

Cites Work

• Contraction theorems in Hamiltonian graph theory
• On n-Hamiltonian graphs
• On characterization of Hamiltonian graphs
• Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
• Parallel concepts in graph theory
• Sufficient conditions for a graph to be Hamiltonian
• A note on Hamiltonian circuits

This page was built for publication: Contraction theorems in Hamiltonian graph theory