Cycle transversals in bounded degree graphs

Autores
Groshaus, Marina Esther; Hell, P.; Klein, S.; Nogueira, L. T.; Protti, F.
Año de publicación
2009
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In this work we consider the problem of finding a minimum Ck-transversal (a subset of vertices hitting all the induced chordless cycles with k vertices) in a graph with bounded maximum degree. In particular, we seek for dichotomy results as follows: for a fixed value of k, finding a minimum Ck-transversal is polynomial-time solvable if k ≤ p, and NP-hard otherwise.
Fil: Groshaus, Marina Esther. Universidad de Buenos Aires; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria; Argentina
Fil: Hell, P.. University Fraser Simon; Canadá
Fil: Klein, S.. Universidade Federal do Rio de Janeiro; Brasil
Fil: Nogueira, L. T.. Universidade Federal Fluminense; Brasil
Fil: Protti, F.. Universidade Federal Fluminense; Brasil. Universidade Federal do Rio de Janeiro; Brasil
Materia
H-Free Graph
H-Subgraph
H-Transversal
Transversal
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by/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/68193
Acceder
id CONICETDig_a4a732a480123b8da0c868d5e752ed8c
oai_identifier_str oai:ri.conicet.gov.ar:11336/68193
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Cycle transversals in bounded degree graphsGroshaus, Marina EstherHell, P.Klein, S.Nogueira, L. T.Protti, F.H-Free GraphH-SubgraphH-TransversalTransversalhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1In this work we consider the problem of finding a minimum Ck-transversal (a subset of vertices hitting all the induced chordless cycles with k vertices) in a graph with bounded maximum degree. In particular, we seek for dichotomy results as follows: for a fixed value of k, finding a minimum Ck-transversal is polynomial-time solvable if k ≤ p, and NP-hard otherwise.Fil: Groshaus, Marina Esther. Universidad de Buenos Aires; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria; ArgentinaFil: Hell, P.. University Fraser Simon; CanadáFil: Klein, S.. Universidade Federal do Rio de Janeiro; BrasilFil: Nogueira, L. T.. Universidade Federal Fluminense; BrasilFil: Protti, F.. Universidade Federal Fluminense; Brasil. Universidade Federal do Rio de Janeiro; BrasilElsevier2009-12info: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/68193Groshaus, Marina Esther; Hell, P.; Klein, S.; Nogueira, L. T.; Protti, F.; Cycle transversals in bounded degree graphs; Elsevier; Electronic Notes in Discrete Mathematics; 35; C; 12-2009; 189-1951365-80501571-0653CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1571065309001851info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2009.11.032info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-22T11:37:05Zoai:ri.conicet.gov.ar:11336/68193instacron: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-22 11:37:05.697CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Cycle transversals in bounded degree graphs
title Cycle transversals in bounded degree graphs
spellingShingle Cycle transversals in bounded degree graphs
Groshaus, Marina Esther
H-Free Graph
H-Subgraph
H-Transversal
Transversal
title_short Cycle transversals in bounded degree graphs
title_full Cycle transversals in bounded degree graphs
title_fullStr Cycle transversals in bounded degree graphs
title_full_unstemmed Cycle transversals in bounded degree graphs
title_sort Cycle transversals in bounded degree graphs
dc.creator.none.fl_str_mv Groshaus, Marina Esther
Hell, P.
Klein, S.
Nogueira, L. T.
Protti, F.
author Groshaus, Marina Esther
author_facet Groshaus, Marina Esther
Hell, P.
Klein, S.
Nogueira, L. T.
Protti, F.
author_role author
author2 Hell, P.
Klein, S.
Nogueira, L. T.
Protti, F.
author2_role author
author
author
author
dc.subject.none.fl_str_mv H-Free Graph
H-Subgraph
H-Transversal
Transversal
topic H-Free Graph
H-Subgraph
H-Transversal
Transversal
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv In this work we consider the problem of finding a minimum Ck-transversal (a subset of vertices hitting all the induced chordless cycles with k vertices) in a graph with bounded maximum degree. In particular, we seek for dichotomy results as follows: for a fixed value of k, finding a minimum Ck-transversal is polynomial-time solvable if k ≤ p, and NP-hard otherwise.
Fil: Groshaus, Marina Esther. Universidad de Buenos Aires; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria; Argentina
Fil: Hell, P.. University Fraser Simon; Canadá
Fil: Klein, S.. Universidade Federal do Rio de Janeiro; Brasil
Fil: Nogueira, L. T.. Universidade Federal Fluminense; Brasil
Fil: Protti, F.. Universidade Federal Fluminense; Brasil. Universidade Federal do Rio de Janeiro; Brasil
description In this work we consider the problem of finding a minimum Ck-transversal (a subset of vertices hitting all the induced chordless cycles with k vertices) in a graph with bounded maximum degree. In particular, we seek for dichotomy results as follows: for a fixed value of k, finding a minimum Ck-transversal is polynomial-time solvable if k ≤ p, and NP-hard otherwise.
publishDate 2009
dc.date.none.fl_str_mv 2009-12
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/68193
Groshaus, Marina Esther; Hell, P.; Klein, S.; Nogueira, L. T.; Protti, F.; Cycle transversals in bounded degree graphs; Elsevier; Electronic Notes in Discrete Mathematics; 35; C; 12-2009; 189-195
1365-8050
1571-0653
CONICET Digital
CONICET
url http://hdl.handle.net/11336/68193
identifier_str_mv Groshaus, Marina Esther; Hell, P.; Klein, S.; Nogueira, L. T.; Protti, F.; Cycle transversals in bounded degree graphs; Elsevier; Electronic Notes in Discrete Mathematics; 35; C; 12-2009; 189-195
1365-8050
1571-0653
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1571065309001851
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2009.11.032
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
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_ 1846782017235058688
score 12.982451

Publicaciones similares