Edge-colourung of join graphs

Academic Article

Publication Date:

2006

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

Iris type:

01.01 Articolo in rivista

List of contributors:

DE SIMONE, Caterina

Handle:

https://iris.cnr.it/handle/20.500.14243/169470

Published in:

THEORETICAL COMPUTER SCIENCE

Journal