Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/63674
Full metadata record
DC FieldValueLanguage
dc.contributor.CRUESPUniversidade Estadual de Campinaspt_BR
dc.typeArtigo de periódicopt_BR
dc.titleEdge-colouring of join graphspt_BR
dc.contributor.authorDe Simone, Cpt_BR
dc.contributor.authorde Mello, CPpt_BR
unicamp.author.emaildesimone@iasi.cnr.itpt_BR
unicamp.author.emailcelia@ic.unicamp.brpt_BR
unicamp.authorUniv Estadual Campinas, Inst Comp, Campinas, SP, Brazil CNR, Ist Anal Sistemi & Informat, I-00185 Rome, Italypt_BR
dc.subjectedge-colouringspt_BR
dc.subjectjoin gaphspt_BR
dc.subjectoverfull graphspt_BR
dc.subject.wosLarge Maximum Degreept_BR
dc.subject.wosChromatic Indexpt_BR
dc.subject.wosNp-completenesspt_BR
dc.subject.wosRegular Graphspt_BR
dc.subject.wosVerticespt_BR
dc.subject.wosNumberpt_BR
dc.subject.wosStarpt_BR
dc.description.abstractA 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.pt
dc.relation.ispartofTheoretical Computer Sciencept_BR
dc.relation.ispartofabbreviationTheor. Comput. Sci.pt_BR
dc.publisher.cityAmsterdampt_BR
dc.publisher.countryHolandapt_BR
dc.publisherElsevier Science Bvpt_BR
dc.date.issued2006pt_BR
dc.date.monthofcirculationAPR 14pt_BR
dc.identifier.citationTheoretical Computer Science. Elsevier Science Bv, v. 355, n. 3, n. 364, n. 370, 2006.pt_BR
dc.language.isoenpt_BR
dc.description.volume355pt_BR
dc.description.issuenumber3pt_BR
dc.description.firstpage364pt_BR
dc.description.lastpage370pt_BR
dc.rightsfechadopt_BR
dc.rights.licensehttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policypt_BR
dc.sourceWeb of Sciencept_BR
dc.identifier.issn0304-3975pt_BR
dc.identifier.wosidWOS:000236437900008pt_BR
dc.identifier.doi10.1016/j.tcs.2005.12.010pt_BR
dc.date.available2014-11-20T06:37:07Z
dc.date.available2015-11-26T17:16:30Z-
dc.date.accessioned2014-11-20T06:37:07Z
dc.date.accessioned2015-11-26T17:16:30Z-
dc.description.provenanceMade available in DSpace on 2014-11-20T06:37:07Z (GMT). No. of bitstreams: 1 WOS000236437900008.pdf: 193442 bytes, checksum: 25515df2e5b68730927895c820018f7b (MD5) Previous issue date: 2006en
dc.description.provenanceMade available in DSpace on 2015-11-26T17:16:30Z (GMT). No. of bitstreams: 2 WOS000236437900008.pdf: 193442 bytes, checksum: 25515df2e5b68730927895c820018f7b (MD5) WOS000236437900008.pdf.txt: 20470 bytes, checksum: 2876414c994ca8c62ba0b61a384abfa7 (MD5) Previous issue date: 2006en
dc.identifier.urihttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/63674pt_BR
dc.identifier.urihttp://www.repositorio.unicamp.br/handle/REPOSIP/63674
dc.identifier.urihttp://repositorio.unicamp.br/jspui/handle/REPOSIP/63674-
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000236437900008.pdf188.91 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.