Transversal Hamilton paths and cycles

DOI10.1137/24M1675011MaRDI QIDQ7308585zbMATH OpenFDO

Authors Yangyang Cheng, Wanting Sun, Guanghui Wang, Lan Wei

Publication date 4 August 2026

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1675011

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Transversal (matching) theory (05D15)

Cites work

• A better bound on the size of rainbow matchings
• A general approach to transversal versions of Dirac‐type theorems
• A General Criterion for the Existence of Transversals
• A rainbow \(r\)-partite version of the Erdős-Ko-Rado theorem
• A rainbow version of Mantel's theorem
• Advances on the Hamiltonian problem -- a survey
• From one to many rainbow Hamiltonian cycles
• Graph theory
• Hamilton cycles, minimum degree, and bipartite holes
• Hamilton transversals in tournaments
• scientific article; zbMATH DE number 3149611 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• Large cycles in graphs
• Large rainbow matchings in general graphs
• Non-Hamiltonian graphs with large minimum degree
• Note on Hamilton Circuits
• On a rainbow version of Dirac's theorem
• On Hamiltonian cycles and Hamiltonian paths
• On one extension of Dirac's theorem on Hamiltonicity
• On sets of almost disjoint subsets of a set
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Rainbow matchings in r-partite r-graphs
• Rainbow pancyclicity in graph systems
• Rainbow perfect matchings for 4-uniform hypergraphs
• Rainbow spanning structures in graph and hypergraph systems
• Rainbow structures in a collection of graphs with degree conditions
• Rainbow version of the Erdős Matching Conjecture via concentration
• Recent advances on the Hamiltonian problem: survey III
• Some Theorems on Abstract Graphs
• Spanning trees in dense graphs
• Stability of transversal Hamilton cycles and paths
• Sufficient Conditions for Circuits in Graphs^†
• The minimum degree threshold for perfect graph packings
• Transversal factors and spanning trees
• Transversal Hamilton cycle in hypergraph systems
• Transversals and bipancyclicity in bipartite graph families
• Transversals in Latin squares: a survey
• Transversals via regularity
• Universality for transversal Hamilton cycles

This page was built for publication: Transversal Hamilton paths and cycles

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