- Report number: 1995-087
- Authors: L. PERKOVIC, B. REED
- Title: Edge coloring regular graphs of high degree
We discuss thefollowing conjecture : If G = (V,E) is a D-regular simple graph with an even number of vertices at most 2D then G is D edge colorable. In this paper we show that the conjecture is true for large graphs if ()V<(2-)D . We discuss related results.
- Complete report:
PostScript file compressed with gzip