Name
Abstract | ||
|---|---|---|
For a graph G, let \({\sigma_2(G)=\min\{d(u)+d(v):uv\notin 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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s00373-011-1066-6 | Graphs and Combinatorics |
Keywords | Field | DocType |
Graph packing, Ore-type degree conditions, 2-factors, 05C35, 05C70 | Discrete mathematics,Graph,Combinatorics,Strongly regular graph,Bound graph,Graph packing,Sigma,Distance-regular graph,Mathematics | Journal |
Volume | Issue | ISSN |
28 | 5 | 1435-5914 |
Citations | PageRank | References |
6 | 0.51 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandr V. Kostochka | 1 | 682 | 89.87 |
| Gexin Yu | 2 | 340 | 40.11 |