Artículos de revistas
Edge-colouring of join graphs
Registro en:
Theoretical Computer Science. Elsevier Science Bv, v. 355, n. 3, n. 364, n. 370, 2006.
0304-3975
WOS:000236437900008
10.1016/j.tcs.2005.12.010
Autor
De Simone, C
de Mello, CP
Institución
Resumen
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. (c) 2006 Elsevier B.V. All rights reserved. 355 3 364 370