Three-coloring and list three-coloring of graphs without induced paths on seven vertices

Autores
Bonomo, Flavia; Chudnovsky, Mariana; Maceli, Peter; Schaudt, Oliver; Stein, Maya; Zhong, Mingxian
Año de publicación
2018
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In this paper we present a polynomial time algorithm that determines if an input graph containing no induced seven-vertex path is 3-colorable. This affirmatively answers a question posed by Randerath, Schiermeyer and Tewes in 2002. Our algorithm also solves the list-coloring version of the 3-coloring problem, where every vertex is assigned a list of colors that is a subset of {1,2,3}, and gives an explicit coloring if one exists.
Fil: Bonomo, Flavia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Chudnovsky, Mariana. University of Princeton; Estados Unidos
Fil: Maceli, Peter. Canisius College; Estados Unidos
Fil: Schaudt, Oliver. Universitat zu Köln; Alemania
Fil: Stein, Maya. Universidad de Chile; Chile
Fil: Zhong, Mingxian. Columbia University; Estados Unidos
Materia
3-coloring
list 3-coloring
P7-free graph
polynomial time algorithm
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/97122
Acceder
id CONICETDig_0d9eb7d0abc5ec502d7a8a27c850b182
oai_identifier_str oai:ri.conicet.gov.ar:11336/97122
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Three-coloring and list three-coloring of graphs without induced paths on seven verticesBonomo, FlaviaChudnovsky, MarianaMaceli, PeterSchaudt, OliverStein, MayaZhong, Mingxian3-coloringlist 3-coloringP7-free graphpolynomial time algorithmhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1https://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1In this paper we present a polynomial time algorithm that determines if an input graph containing no induced seven-vertex path is 3-colorable. This affirmatively answers a question posed by Randerath, Schiermeyer and Tewes in 2002. Our algorithm also solves the list-coloring version of the 3-coloring problem, where every vertex is assigned a list of colors that is a subset of {1,2,3}, and gives an explicit coloring if one exists.Fil: Bonomo, Flavia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaFil: Chudnovsky, Mariana. University of Princeton; Estados UnidosFil: Maceli, Peter. Canisius College; Estados UnidosFil: Schaudt, Oliver. Universitat zu Köln; AlemaniaFil: Stein, Maya. Universidad de Chile; ChileFil: Zhong, Mingxian. Columbia University; Estados UnidosSpringer2018-08info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/97122Bonomo, Flavia; Chudnovsky, Mariana; Maceli, Peter; Schaudt, Oliver; Stein, Maya; et al.; Three-coloring and list three-coloring of graphs without induced paths on seven vertices; Springer; Combinatorica; 38; 4; 8-2018; 779-8010209-9683CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1007/s00493-017-3553-8info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007%2Fs00493-017-3553-8info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-15T14:28:54Zoai:ri.conicet.gov.ar:11336/97122instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-15 14:28:54.58CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Three-coloring and list three-coloring of graphs without induced paths on seven vertices
title Three-coloring and list three-coloring of graphs without induced paths on seven vertices
spellingShingle Three-coloring and list three-coloring of graphs without induced paths on seven vertices
Bonomo, Flavia
3-coloring
list 3-coloring
P7-free graph
polynomial time algorithm
title_short Three-coloring and list three-coloring of graphs without induced paths on seven vertices
title_full Three-coloring and list three-coloring of graphs without induced paths on seven vertices
title_fullStr Three-coloring and list three-coloring of graphs without induced paths on seven vertices
title_full_unstemmed Three-coloring and list three-coloring of graphs without induced paths on seven vertices
title_sort Three-coloring and list three-coloring of graphs without induced paths on seven vertices
dc.creator.none.fl_str_mv Bonomo, Flavia
Chudnovsky, Mariana
Maceli, Peter
Schaudt, Oliver
Stein, Maya
Zhong, Mingxian
author Bonomo, Flavia
author_facet Bonomo, Flavia
Chudnovsky, Mariana
Maceli, Peter
Schaudt, Oliver
Stein, Maya
Zhong, Mingxian
author_role author
author2 Chudnovsky, Mariana
Maceli, Peter
Schaudt, Oliver
Stein, Maya
Zhong, Mingxian
author2_role author
author
author
author
author
dc.subject.none.fl_str_mv 3-coloring
list 3-coloring
P7-free graph
polynomial time algorithm
topic 3-coloring
list 3-coloring
P7-free graph
polynomial time algorithm
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv In this paper we present a polynomial time algorithm that determines if an input graph containing no induced seven-vertex path is 3-colorable. This affirmatively answers a question posed by Randerath, Schiermeyer and Tewes in 2002. Our algorithm also solves the list-coloring version of the 3-coloring problem, where every vertex is assigned a list of colors that is a subset of {1,2,3}, and gives an explicit coloring if one exists.
Fil: Bonomo, Flavia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Chudnovsky, Mariana. University of Princeton; Estados Unidos
Fil: Maceli, Peter. Canisius College; Estados Unidos
Fil: Schaudt, Oliver. Universitat zu Köln; Alemania
Fil: Stein, Maya. Universidad de Chile; Chile
Fil: Zhong, Mingxian. Columbia University; Estados Unidos
description In this paper we present a polynomial time algorithm that determines if an input graph containing no induced seven-vertex path is 3-colorable. This affirmatively answers a question posed by Randerath, Schiermeyer and Tewes in 2002. Our algorithm also solves the list-coloring version of the 3-coloring problem, where every vertex is assigned a list of colors that is a subset of {1,2,3}, and gives an explicit coloring if one exists.
publishDate 2018
dc.date.none.fl_str_mv 2018-08
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/97122
Bonomo, Flavia; Chudnovsky, Mariana; Maceli, Peter; Schaudt, Oliver; Stein, Maya; et al.; Three-coloring and list three-coloring of graphs without induced paths on seven vertices; Springer; Combinatorica; 38; 4; 8-2018; 779-801
0209-9683
CONICET Digital
CONICET
url http://hdl.handle.net/11336/97122
identifier_str_mv Bonomo, Flavia; Chudnovsky, Mariana; Maceli, Peter; Schaudt, Oliver; Stein, Maya; et al.; Three-coloring and list three-coloring of graphs without induced paths on seven vertices; Springer; Combinatorica; 38; 4; 8-2018; 779-801
0209-9683
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1007/s00493-017-3553-8
info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007%2Fs00493-017-3553-8
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846082755789586432
score 13.22299

Publicaciones similares