Abstract
For a graph G, let σ 2 = min {d(u) + d(υ): uυ E(G)}. We prove that every n-vertex graph G with σ 2(G) ≥ 4n/3 - 1 contains each 2-regular n-vertex graph. This extends a theorem due to Aigner and Brandt and to Alon and Fisher.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 687-716 |
| Number of pages | 30 |
| Journal | Graphs and Combinatorics |
| Volume | 28 |
| Issue number | 5 |
| DOIs | |
| State | Published - Sep 2012 |
Keywords
- 2-factors
- Graph packing
- Ore-type degree conditions
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics