Edge-colouring of join graphs

Authors:
Caterina De Simone;C. P. de Mello
Affiliations:
Istituto di Analisi dei Sistemi ed Informatica (IASI), CNR, Rome, Italy;Instituto de Computação, UNICAMP, Brasil
Venue:
Theoretical Computer Science
Year:
2006

Citing 5
Cited 6

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
NP-completeness of edge-colouring some restricted graphs

Discrete Applied Mathematics
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 regular graphs of large degree

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
Decompositions for edge-coloring join graphs and cobipartite graphs

Discrete Applied Mathematics
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

A join graph is the complete union of two arbitrary graphs. We give sufficient conditions for a join graph to be 1-factorizable. As a consequence of our results, the Hilton's Overfull Subgraph Conjecture holds true for several subclasses of join graphs.