The following pages link to (Q3576703):
Displaying 11 items.
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs (Q544011) (← links)
- Removable matchings and Hamiltonian cycles (Q1011771) (← links)
- A degree condition implying that every matching is contained in a Hamiltonian cycle (Q1025570) (← links)
- Perfect matchings extend to Hamilton cycles in hypercubes (Q2384812) (← links)
- Santa claus meets hypergraph matchings (Q3189065) (← links)
- A Dirac-Type Theorem for 3-Uniform Hypergraphs (Q3373667) (← links)
- Santa Claus Meets Hypergraph Matchings (Q3541783) (← links)
- (Q4203484) (← links)
- Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs (Q4979823) (← links)
- Squares of Hamiltonian cycles in 3‐uniform hypergraphs (Q5113942) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492845) (← links)