On characterization of Hamiltonian graphs

DOI10.1016/S0095-8956(78)80009-4MaRDI QIDQ1225064zbMATH OpenOpenAlexFDO

Authors C. Hoede, Henk Jan Veldman

Publication date 1978

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0095-8956(78)80009-4

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited in

(4)

• Contraction theorems in Hamiltonian graph theory
• Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian
• Contracting to a longest path in H-free graphs
• Existence of dominating cycles and paths

This page was built for publication: On characterization of Hamiltonian graphs

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