b-Coloring graphs with large girth

Please use this identifier to cite or link to this item: http://repositorio.ufc.br/handle/riufc/40706

Full metadata record

DC Field	Value	Language
dc.contributor.author	Campos, Victor Almeida	-
dc.contributor.author	Farias, Victor Aguiar Evangelista de	-
dc.contributor.author	Silva, Ana Shirley Ferreira da	-
dc.date.accessioned	2019-04-09T16:20:27Z	-
dc.date.available	2019-04-09T16:20:27Z	-
dc.date.issued	2012	-
dc.identifier.citation	CAMPOS, Victor Almeida; FARIAS, Victor Aguiar Evangelista de; SILVA, Ana Shirley Ferreira da. b-Coloring graphs with large girth. Journal of The Brazilian Computer Society, v. 18, p. 375-378, 2012.	pt_BR
dc.identifier.uri	http://www.repositorio.ufc.br/handle/riufc/40706	-
dc.description.abstract	A b-coloring of a graph is a coloring of its vertices such that every color class contains a vertex that has a neighbor in all other classes. The b-chromatic number of a graph is the largest integer k such that the graph has a b-coloring with k colors. We show how to compute in polynomial time the b-chromatic number of a graph of girth at least 9. This improves the seminal result of Irving and Manlove on trees	pt_BR
dc.language.iso	en	pt_BR
dc.publisher	Journal of The Brazilian Computer Society	pt_BR
dc.rights	Acesso Aberto	pt_BR
dc.subject	Coloração de grafos	-
dc.subject	b-Chromatic number	pt_BR
dc.subject	b-Coloring	pt_BR
dc.subject	m-Degree	pt_BR
dc.subject	Girth	pt_BR
dc.subject	Exact algorithm	pt_BR
dc.title	b-Coloring graphs with large girth	pt_BR
dc.type	Artigo de Periódico	pt_BR
dc.title.en	b-Coloring graphs with large girth	pt_BR
Appears in Collections:	DMAT - Artigos publicados em revista científica

Files in This Item:

File	Description	Size	Format
2012_art_vacampos.pdf		142,58 kB	Adobe PDF	View/Open