Edge coloring regular graphs of high degree
Proceedings of an international symposium on Graphs and combinatorics
Graph Theory
| Hi-index | 0.00 |
We give a self-contained proof that for all positive integers r and all , there is an integer such that for all any regular multigraph of order 2n with multiplicity at most r and degree at least is 1-factorizable. This generalizes results of Perković and Reed (Discrete Math 165/166 (1997), 567–578) and Plantholt and Tipnis (J London Math Soc 44 (1991), 393–400). © 2013 Wiley Periodicals, Inc.