Subgraphs intersecting any Hamiltonian cycle

DOI10.1016/0095-8956(88)90097-4MaRDI QIDQ1077429zbMATH OpenOpenAlexFDO

Authors 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

vertex coveringsubgraphhamiltonian cyclemaximal non-hamiltonian graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 861428
• MinimumK-hamiltonian graphs
• Publication:3469119
• The number of cycles in a Hamilton graph
• scientific article; zbMATH DE number 4152419

Cites work

• scientific article; zbMATH DE number 3869331 (Why is no real title available?)
• scientific article; zbMATH DE number 3689432 (Why is no real title available?)
• scientific article; zbMATH DE number 3186566 (Why is no real title available?)
• A catalogue of small maximal nonhamiltonian graphs
• A method in graph theory
• Arc coverings of graphs
• On Hamilton's ideals
• On Representatives of Subsets
• On a construction of Thomassen
• Variations on the Hamiltonian Theme

Cited in

(3)

• Solution of two problems of P. Erdős concerning Hamiltonian cycles
• Minimum multiplicities of subgraphs and Hamiltonian cycles
• The number of edges in a subgraph of a Hamming graph

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

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