Contraction theorems in Hamiltonian graph theory

DOI10.1016/0012-365X(81)90022-4MaRDI QIDQ1146694zbMATH OpenFDO

Authors C. 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)

Cites work

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

Cited in

(5)

• Contraction theorems in Hamiltonian graph theory
• 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
• Contracting to a longest path in H-free graphs

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

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