Edge coloring regular graphs of high degree

DOI10.1016/S0012-365X(96)00202-6MaRDI QIDQ1356779zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ljubomir Perković, Bruce 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

zbMATH Keywords

edge-coloringregular graph1-factorchromatic index

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Edge-colouring of regular graphs of large degree
• Regular Graphs of High Degree are 1-Factorizable
• Edge coloring graphs with large minimum degree
• Two conjectures on edge-colouring
• Regular Multigraphs of High Degree are 1-Factorizable

Cites work

• scientific article; zbMATH DE number 3427408 (Why is no real title available?)
• scientific article; zbMATH DE number 3428958 (Why is no real title available?)
• 1-factorizing regular graphs of high degree - an improved bound
• 25 pretty graph colouring problems
• Graphs which are vertex-critical with respect to the edge-chromatic number
• Regular Graphs of High Degree are 1-Factorizable
• The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small

Cited in

(23)

• Regular graphs and edge chromatic number
• Hamilton decompositions of regular expanders: applications
• Proof of the 1-factorization and Hamilton Decomposition Conjectures
• Graph factors and factorization: 1985--2003: a survey
• Edge coloring graphs with large minimum degree
• Edge-colouring of join graphs
• Explicit \(\Delta \)-edge-coloring of consecutive levels in a divisor lattice
• Graph edge coloring: a survey
• The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark
• Regular colorings in regular graphs
• Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs
• Edge-colouring eight-regular planar graphs
• Edge-colouring of regular graphs of large degree
• An application of Tutte's theorem to 1-factorization of regular graphs of high degree
• Edge-colouring of joins of regular graphs. II
• Number of 1-factorizations of regular high-degree graphs
• Edge-colouring of joins of regular graphs. I
• Edge-coloring critical graphs with high degree
• A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs
• Regular Multigraphs of High Degree are 1-Factorizable
• The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)
• Edge coloring nearly bipartite graphs
• The number of disjoint perfect matchings in semi-regular graphs

This page was built for publication: Edge coloring regular graphs of high degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356779)