Edge-colourung of join graphs

Articolo
Data di Pubblicazione:
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
Tipologia CRIS:
01.01 Articolo in rivista
Elenco autori:
Link alla scheda completa:
https://iris.cnr.it/handle/20.500.14243/169470
Pubblicato in:
THEORETICAL COMPUTER SCIENCE
Journal