Edge-colouring of regular graphs of large degree

Authors:
Caterina De Simone;Anna Galluccio
Affiliations:
Istituto di Analisi dei Sistemi ed Informatica (IASI), CNR, Rome, Italy;Istituto di Analisi dei Sistemi ed Informatica (IASI), CNR, Rome, Italy
Venue:
Theoretical Computer Science
Year:
2007

Citing 5
Cited 4

The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small

Journal of Combinatorial Theory Series B
Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree

Journal of Graph Theory
The chromatic index of complete multipartite graphs

Journal of Graph Theory
Edge coloring regular graphs of high degree

Proceedings of an international symposium on Graphs and combinatorics
Edge-colouring of join graphs

Theoretical Computer Science

A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Chromatic index of graphs with no cycle with a unique chord

Theoretical Computer Science
The P versus NP-complete dichotomy of some challenging problems in graph theory

Discrete Applied Mathematics
Edge-colouring of joins of regular graphs II

Journal of Combinatorial Optimization

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider the following conjecture: LetGbe ak-regular simple graph with an even numbernof vertices. Ifk=n/2thenGisk-edge-colourable. We show that this conjecture is true for graphs that are join of two graphs and we provide a polynomial time algorithm for finding a k-edge-colouring of these graphs.