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

DOI10.1016/0012-365X(90)90269-NMaRDI QIDQ810050zbMATH OpenOpenAlexFDO

Authors Jozef Širáň, Peter Horák

Publication date 1990

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(90)90269-n

zbMATH Keywords

packingnon-Hamiltonian complement

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 3943849
• Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
• A solution to Erdős and Hajnal’s odd cycle problem
• On two problems regarding the Hamiltonian cycle game
• An extremal problem for cycles in hamiltonian graphs
• scientific article; zbMATH DE number 1123890
• scientific article; zbMATH DE number 22818
• scientific article; zbMATH DE number 3838109
• Publication:3469119
• scientific article; zbMATH DE number 637361

Cites work

• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• scientific article; zbMATH DE number 3186566 (Why is no real title available?)
• Subgraphs intersecting any Hamiltonian cycle

Cited in

(6)

• Clumsy packings of graphs
• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
• Packing without some pieces
• scientific article; zbMATH DE number 3943849 (Why is no real title available?)
• Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
• Reducing the generalised Sudoku problem to the Hamiltonian cycle problem

This page was built for publication: Solution of two problems of P. Erdős concerning Hamiltonian cycles

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