Repositório da Produção Científica e Intelectual da Unicamp Please use this identifier to cite or link to this item:
http://repositorio.unicamp.br/jspui/handle/REPOSIP/63674
| Type: | Artigo de periódico |
| Title: | Edge-colouring of join graphs |
| Author: | De Simone, C de Mello, CP |
| 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. (c) 2006 Elsevier B.V. All rights reserved. |
| Subject: | edge-colourings join gaphs overfull graphs |
| Country: | Holanda |
| Editor: | Elsevier Science Bv |
| Citation: | Theoretical Computer Science. Elsevier Science Bv, v. 355, n. 3, n. 364, n. 370, 2006. |
| Rights: | fechado |
| Identifier DOI: | 10.1016/j.tcs.2005.12.010 |
| Date Issue: | 2006 |
| Appears in Collections: | Unicamp - Artigos e Outros Documentos |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| WOS000236437900008.pdf | 188.91 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.