b-Coloring graphs with large girth

Detalhes bibliográficos
Autor(a) principal: Campos, Victor Almeida
Data de Publicação: 2012
Outros Autores: Farias, Victor Aguiar Evangelista de, Silva, Ana Shirley Ferreira da
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da Universidade Federal do Ceará (UFC)
Texto Completo: http://www.repositorio.ufc.br/handle/riufc/40706
Resumo: 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
id UFC-7_c82399dd6f594aebd8ac654f0e195945
oai_identifier_str oai:repositorio.ufc.br:riufc/40706
network_acronym_str UFC-7
network_name_str Repositório Institucional da Universidade Federal do Ceará (UFC)
repository_id_str
spelling b-Coloring graphs with large girthb-Coloring graphs with large girthColoração de grafosb-Chromatic numberb-Coloringm-DegreeGirthExact algorithmA 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 treesJournal of The Brazilian Computer Society2019-04-09T16:20:27Z2019-04-09T16:20:27Z2012info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfCAMPOS, 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.http://www.repositorio.ufc.br/handle/riufc/40706Campos, Victor AlmeidaFarias, Victor Aguiar Evangelista deSilva, Ana Shirley Ferreira dainfo:eu-repo/semantics/openAccessengreponame:Repositório Institucional da Universidade Federal do Ceará (UFC)instname:Universidade Federal do Ceará (UFC)instacron:UFC2023-10-31T14:37:46Zoai:repositorio.ufc.br:riufc/40706Repositório InstitucionalPUBhttp://www.repositorio.ufc.br/ri-oai/requestbu@ufc.br || repositorio@ufc.bropendoar:2024-09-11T18:35:33.972219Repositório Institucional da Universidade Federal do Ceará (UFC) - Universidade Federal do Ceará (UFC)false
dc.title.none.fl_str_mv b-Coloring graphs with large girth
b-Coloring graphs with large girth
title b-Coloring graphs with large girth
spellingShingle b-Coloring graphs with large girth
Campos, Victor Almeida
Coloração de grafos
b-Chromatic number
b-Coloring
m-Degree
Girth
Exact algorithm
title_short b-Coloring graphs with large girth
title_full b-Coloring graphs with large girth
title_fullStr b-Coloring graphs with large girth
title_full_unstemmed b-Coloring graphs with large girth
title_sort b-Coloring graphs with large girth
author Campos, Victor Almeida
author_facet Campos, Victor Almeida
Farias, Victor Aguiar Evangelista de
Silva, Ana Shirley Ferreira da
author_role author
author2 Farias, Victor Aguiar Evangelista de
Silva, Ana Shirley Ferreira da
author2_role author
author
dc.contributor.author.fl_str_mv Campos, Victor Almeida
Farias, Victor Aguiar Evangelista de
Silva, Ana Shirley Ferreira da
dc.subject.por.fl_str_mv Coloração de grafos
b-Chromatic number
b-Coloring
m-Degree
Girth
Exact algorithm
topic Coloração de grafos
b-Chromatic number
b-Coloring
m-Degree
Girth
Exact algorithm
description 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
publishDate 2012
dc.date.none.fl_str_mv 2012
2019-04-09T16:20:27Z
2019-04-09T16:20:27Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv 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.
http://www.repositorio.ufc.br/handle/riufc/40706
identifier_str_mv 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.
url http://www.repositorio.ufc.br/handle/riufc/40706
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Journal of The Brazilian Computer Society
publisher.none.fl_str_mv Journal of The Brazilian Computer Society
dc.source.none.fl_str_mv reponame:Repositório Institucional da Universidade Federal do Ceará (UFC)
instname:Universidade Federal do Ceará (UFC)
instacron:UFC
instname_str Universidade Federal do Ceará (UFC)
instacron_str UFC
institution UFC
reponame_str Repositório Institucional da Universidade Federal do Ceará (UFC)
collection Repositório Institucional da Universidade Federal do Ceará (UFC)
repository.name.fl_str_mv Repositório Institucional da Universidade Federal do Ceará (UFC) - Universidade Federal do Ceará (UFC)
repository.mail.fl_str_mv bu@ufc.br || repositorio@ufc.br
_version_ 1813028868459593728

Registros relacionados