The minimum degree threshold for perfect graph packings
From MaRDI portal
Publication:6476936
DOI10.1007/S00493-009-2254-3zbMath1517.05143arXivmath/0603665MaRDI QIDQ6476936
Publication date: 28 March 2006
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
This page was built for publication: The minimum degree threshold for perfect graph packings