The following pages link to 2-factors in dense graphs (Q1917480):
Displaying 19 items.
- Hamiltonian cycles with all small even chords (Q409469) (← links)
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs (Q933679) (← links)
- Proof of the bandwidth conjecture of Bollobás and Komlós (Q957895) (← links)
- On a graph packing conjecture by Bollobás, Eldridge and Catlin (Q987545) (← links)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- Ore-type conditions implying 2-factors consisting of short cycles (Q1044946) (← links)
- Cycle factors in dense graphs (Q1292839) (← links)
- Blow-up lemma (Q1375060) (← links)
- Fan-type condition on disjoint cycles in a graph (Q1699571) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- A near packing of two graphs (Q1850487) (← links)
- Graphs containing every 2-factor (Q1926028) (← links)
- Packing \(d\)-degenerate graphs (Q2464154) (← links)
- On Degree Sequences Forcing The Square of a Hamilton Cycle (Q2968516) (← links)
- Embedding Graphs Having Ore-Degree at Most Five (Q3119788) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem (Q3449866) (← links)
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs (Q5443799) (← links)
- A robust Corrádi-Hajnal theorem (Q6641058) (← links)
