Powers of cycles, powers of paths, and distance graphs

Autores
Lin, M.C.; Rautenbach, D.; Soulignac, F.J.; Szwarcfiter, J.L.
Año de publicación
2011
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In 1988, Golumbic and Hammer characterized the powers of cycles, relating them to circular arc graphs. We extend their results and propose several further structural characterizations for both powers of cycles and powers of paths. The characterizations lead to linear-time recognition algorithms of these classes of graphs. Furthermore, as a generalization of powers of cycles, powers of paths, and even of the well-known circulant graphs, we consider distance graphs. While the colorings of these graphs have been intensively studied, the recognition problem has been so far neglected. We propose polynomial-time recognition algorithms for these graphs under additional restrictions. © 2010 Elsevier B.V. All rights reserved.
Fil:Lin, M.C. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fil:Soulignac, F.J. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fuente
Discrete Appl Math 2011;159(7):621-627
Materia
Circulant graph
Circular arc graph
Cycle
Distance graph
Interval graph
Path
Circulant graphs
Circular-arc graph
Cycle
Distance graph
Interval graph
Path
Algorithms
Graphic methods
Graph theory
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by/2.5/ar
Repositorio
Biblioteca Digital (UBA-FCEN)
Institución
Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
OAI Identificador
paperaa:paper_0166218X_v159_n7_p621_Lin
Acceder
id BDUBAFCEN_effe136527a2ab3dfc53d49102ddce5f
oai_identifier_str paperaa:paper_0166218X_v159_n7_p621_Lin
network_acronym_str BDUBAFCEN
repository_id_str 1896
network_name_str Biblioteca Digital (UBA-FCEN)
spelling Powers of cycles, powers of paths, and distance graphsLin, M.C.Rautenbach, D.Soulignac, F.J.Szwarcfiter, J.L.Circulant graphCircular arc graphCycleDistance graphInterval graphPathCirculant graphsCircular-arc graphCycleDistance graphInterval graphPathAlgorithmsGraphic methodsGraph theoryIn 1988, Golumbic and Hammer characterized the powers of cycles, relating them to circular arc graphs. We extend their results and propose several further structural characterizations for both powers of cycles and powers of paths. The characterizations lead to linear-time recognition algorithms of these classes of graphs. Furthermore, as a generalization of powers of cycles, powers of paths, and even of the well-known circulant graphs, we consider distance graphs. While the colorings of these graphs have been intensively studied, the recognition problem has been so far neglected. We propose polynomial-time recognition algorithms for these graphs under additional restrictions. © 2010 Elsevier B.V. All rights reserved.Fil:Lin, M.C. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.Fil:Soulignac, F.J. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.2011info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfhttp://hdl.handle.net/20.500.12110/paper_0166218X_v159_n7_p621_LinDiscrete Appl Math 2011;159(7):621-627reponame:Biblioteca Digital (UBA-FCEN)instname:Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesinstacron:UBA-FCENenginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/2.5/ar2025-09-04T09:48:41Zpaperaa:paper_0166218X_v159_n7_p621_LinInstitucionalhttps://digital.bl.fcen.uba.ar/Universidad públicaNo correspondehttps://digital.bl.fcen.uba.ar/cgi-bin/oaiserver.cgiana@bl.fcen.uba.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:18962025-09-04 09:48:43.247Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesfalse
dc.title.none.fl_str_mv Powers of cycles, powers of paths, and distance graphs
title Powers of cycles, powers of paths, and distance graphs
spellingShingle Powers of cycles, powers of paths, and distance graphs
Lin, M.C.
Circulant graph
Circular arc graph
Cycle
Distance graph
Interval graph
Path
Circulant graphs
Circular-arc graph
Cycle
Distance graph
Interval graph
Path
Algorithms
Graphic methods
Graph theory
title_short Powers of cycles, powers of paths, and distance graphs
title_full Powers of cycles, powers of paths, and distance graphs
title_fullStr Powers of cycles, powers of paths, and distance graphs
title_full_unstemmed Powers of cycles, powers of paths, and distance graphs
title_sort Powers of cycles, powers of paths, and distance graphs
dc.creator.none.fl_str_mv Lin, M.C.
Rautenbach, D.
Soulignac, F.J.
Szwarcfiter, J.L.
author Lin, M.C.
author_facet Lin, M.C.
Rautenbach, D.
Soulignac, F.J.
Szwarcfiter, J.L.
author_role author
author2 Rautenbach, D.
Soulignac, F.J.
Szwarcfiter, J.L.
author2_role author
author
author
dc.subject.none.fl_str_mv Circulant graph
Circular arc graph
Cycle
Distance graph
Interval graph
Path
Circulant graphs
Circular-arc graph
Cycle
Distance graph
Interval graph
Path
Algorithms
Graphic methods
Graph theory
topic Circulant graph
Circular arc graph
Cycle
Distance graph
Interval graph
Path
Circulant graphs
Circular-arc graph
Cycle
Distance graph
Interval graph
Path
Algorithms
Graphic methods
Graph theory
dc.description.none.fl_txt_mv In 1988, Golumbic and Hammer characterized the powers of cycles, relating them to circular arc graphs. We extend their results and propose several further structural characterizations for both powers of cycles and powers of paths. The characterizations lead to linear-time recognition algorithms of these classes of graphs. Furthermore, as a generalization of powers of cycles, powers of paths, and even of the well-known circulant graphs, we consider distance graphs. While the colorings of these graphs have been intensively studied, the recognition problem has been so far neglected. We propose polynomial-time recognition algorithms for these graphs under additional restrictions. © 2010 Elsevier B.V. All rights reserved.
Fil:Lin, M.C. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fil:Soulignac, F.J. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
description In 1988, Golumbic and Hammer characterized the powers of cycles, relating them to circular arc graphs. We extend their results and propose several further structural characterizations for both powers of cycles and powers of paths. The characterizations lead to linear-time recognition algorithms of these classes of graphs. Furthermore, as a generalization of powers of cycles, powers of paths, and even of the well-known circulant graphs, we consider distance graphs. While the colorings of these graphs have been intensively studied, the recognition problem has been so far neglected. We propose polynomial-time recognition algorithms for these graphs under additional restrictions. © 2010 Elsevier B.V. All rights reserved.
publishDate 2011
dc.date.none.fl_str_mv 2011
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/20.500.12110/paper_0166218X_v159_n7_p621_Lin
url http://hdl.handle.net/20.500.12110/paper_0166218X_v159_n7_p621_Lin
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/2.5/ar
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/2.5/ar
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv Discrete Appl Math 2011;159(7):621-627
reponame:Biblioteca Digital (UBA-FCEN)
instname:Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron:UBA-FCEN
reponame_str Biblioteca Digital (UBA-FCEN)
collection Biblioteca Digital (UBA-FCEN)
instname_str Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron_str UBA-FCEN
institution UBA-FCEN
repository.name.fl_str_mv Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
repository.mail.fl_str_mv ana@bl.fcen.uba.ar
_version_ 1842340706491826176
score 12.623145

Publicaciones similares