Edge coloring regular graphs of high degree
From MaRDI portal
Publication:1356779
DOI10.1016/S0012-365X(96)00202-6zbMath0902.05030OpenAlexW1986604231WikidataQ62638562 ScholiaQ62638562MaRDI QIDQ1356779
Ljubomir Perković, Bruce A. Reed
Publication date: 15 December 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00202-6
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The number of disjoint perfect matchings in semi-regular graphs ⋮ Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ Edge-colouring of join graphs ⋮ The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) ⋮ Edge-colouring of joins of regular graphs. I ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Edge coloring graphs with large minimum degree ⋮ Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs ⋮ Edge-colouring of joins of regular graphs. II ⋮ Hamilton decompositions of regular expanders: applications ⋮ Number of 1-factorizations of regular high-degree graphs ⋮ Graph edge coloring: a survey ⋮ Edge-colouring of regular graphs of large degree ⋮ An application of Tutte's theorem to 1-factorization of regular graphs of high degree ⋮ A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs ⋮ Edge coloring nearly bipartite graphs
Cites Work
- The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
- 1-factorizing regular graphs of high degree - an improved bound
- Graphs which are vertex-critical with respect to the edge-chromatic number
- Regular Graphs of High Degree are 1-Factorizable
- 25 pretty graph colouring problems
- Unnamed Item
- Unnamed Item
