The following pages link to Ore-type graph packing problems (Q3429747):
Displayed 11 items.
- An Ore-type theorem on Hamiltonian square cycles (Q354425) (← links)
- A fast algorithm for equitable coloring (Q532129) (← links)
- Ore-type versions of Brooks' theorem (Q1003831) (← links)
- Ore-type conditions implying 2-factors consisting of short cycles (Q1044946) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Graphs containing every 2-factor (Q1926028) (← links)
- An Ore-type theorem on equitable coloring (Q2464162) (← links)
- Embedding Graphs Having Ore-Degree at Most Five (Q3119788) (← links)
- A QUESTION ON RELAXED EQUITABLE COLORING (Q3166752) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring (Q3512604) (← links)