Edge-colouring of regular graphs of large degree

DOI10.1016/J.TCS.2007.07.046zbMATH Open1143.05026OpenAlexW1980938219MaRDI QIDQ2465629FDOQ2465629

Authors: Caterina De Simone, A. Galluccio 

Publication date: 7 January 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.046

Recommendations

• Edge coloring regular graphs of high degree
• Regular Graphs of High Degree are 1-Factorizable
• Edge-colouring of joins of regular graphs. II
• Edge-colouring of joins of regular graphs. I
• Regular graphs and edge chromatic number

zbMATH Keywords

joinregular graphedge-colouring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Normal hypergraphs and the perfect graph conjecture
• Complement reducible graphs
• On certain polytopes associated with graphs
• The NP-Completeness of Edge-Coloring
• The chromatic index of complete multipartite graphs
• 25 pretty graph colouring problems
• A Linear Recognition Algorithm for Cographs
• Edge-colouring of join graphs
• 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
• Investigations on an edge coloring problem
• The Solution of a Timetabling Problem
• Title not available (Why is that?)
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• Edge coloring regular graphs of high degree

Cited In (19)

• Edge-colorings of some large graphs on alphabets
• Edge-colouring of joins of regular graphs. I
• Edge-colouring graphs with bounded local degree sums
• The number of disjoint perfect matchings in semi-regular graphs
• The P versus NP-complete dichotomy of some challenging problems in graph theory
• Edge-coloring critical graphs with high degree
• Amalgamations of almost regular edge-colourings of simple graphs
• Edge-colouring seven-regular planar graphs
• Edge-colouring eight-regular planar graphs
• Chromatic index of graphs with no cycle with a unique chord
• A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs
• Enumerating the edge-colourings and total colourings of a regular graph
• A graph coloring problem
• Edge Colorings and Circular Flow Numbers of Regular Graphs
• A conjecture on edge coloring of graphs
• Regular graphs and edge chromatic number
• Edge-colouring of joins of regular graphs. II
• Optimal edge coloring of large graphs
• The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark

This page was built for publication: Edge-colouring of regular graphs of large degree

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