Subgraphs intersecting any Hamiltonian cycle

DOI10.1016/0095-8956(88)90097-4zbMath0595.05046OpenAlexW2082969553MaRDI QIDQ1077429

Peter Horák

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90097-4

zbMATH Keywords

subgraphvertex coveringhamiltonian cyclemaximal non-hamiltonian graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Solution of two problems of P. Erdős concerning Hamiltonian cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arc coverings of graphs
• On a construction of Thomassen
• A catalogue of small maximal nonhamiltonian graphs
• A method in graph theory
• On Hamilton's ideals
• On Representatives of Subsets
• Variations on the Hamiltonian Theme

This page was built for publication: Subgraphs intersecting any Hamiltonian cycle