End vertices in containment interval graphs

Autores
Alcón, Liliana Graciela; Gudiño, Noemí Amalia; Gutierrez, Marisa
Año de publicación
2017
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
An interval containment model of a graph maps vertices intointervals of a line in such a way that two vertices are adjacent ifand only if the corresponding intervals are comparable under theinclusion relation. Graphs admitting an interval containment modelare called containment interval graphs or CI graphs for short. Avertex v of a CI graph G is an end-vertex if there is an intervalcontainment model of G in which the left endpoint of the intervalcorresponding to v is less than all other endpoints. In this work,we present a characterization of end-vertices in terms of forbiddeninduced subgraphs.
Fil: Alcón, Liliana Graciela. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina
Fil: Gudiño, Noemí Amalia. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina
Fil: Gutierrez, Marisa. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina
Materia
End vertices
Contaiment
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/75962
Acceder
id CONICETDig_0bc90dc4b5f8483da2163106251eedb8
oai_identifier_str oai:ri.conicet.gov.ar:11336/75962
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling End vertices in containment interval graphsAlcón, Liliana GracielaGudiño, Noemí AmaliaGutierrez, MarisaEnd verticesContaimenthttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1An interval containment model of a graph maps vertices intointervals of a line in such a way that two vertices are adjacent ifand only if the corresponding intervals are comparable under theinclusion relation. Graphs admitting an interval containment modelare called containment interval graphs or CI graphs for short. Avertex v of a CI graph G is an end-vertex if there is an intervalcontainment model of G in which the left endpoint of the intervalcorresponding to v is less than all other endpoints. In this work,we present a characterization of end-vertices in terms of forbiddeninduced subgraphs.Fil: Alcón, Liliana Graciela. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; ArgentinaFil: Gudiño, Noemí Amalia. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; ArgentinaFil: Gutierrez, Marisa. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; ArgentinaSociedade Brasileira de Matematica2017-11info: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/75962Alcón, Liliana Graciela; Gudiño, Noemí Amalia; Gutierrez, Marisa; End vertices in containment interval graphs; Sociedade Brasileira de Matematica; Matematica Contemporanea; 45; 11-2017; 86-960103-9059CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/http://mc.sbm.org.br/wp-content/uploads/sites/15/2018/12/45-11.pdfinfo: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-09-29T10:46:35Zoai:ri.conicet.gov.ar:11336/75962instacron: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-09-29 10:46:35.826CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv End vertices in containment interval graphs
title End vertices in containment interval graphs
spellingShingle End vertices in containment interval graphs
Alcón, Liliana Graciela
End vertices
Contaiment
title_short End vertices in containment interval graphs
title_full End vertices in containment interval graphs
title_fullStr End vertices in containment interval graphs
title_full_unstemmed End vertices in containment interval graphs
title_sort End vertices in containment interval graphs
dc.creator.none.fl_str_mv Alcón, Liliana Graciela
Gudiño, Noemí Amalia
Gutierrez, Marisa
author Alcón, Liliana Graciela
author_facet Alcón, Liliana Graciela
Gudiño, Noemí Amalia
Gutierrez, Marisa
author_role author
author2 Gudiño, Noemí Amalia
Gutierrez, Marisa
author2_role author
author
dc.subject.none.fl_str_mv End vertices
Contaiment
topic End vertices
Contaiment
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv An interval containment model of a graph maps vertices intointervals of a line in such a way that two vertices are adjacent ifand only if the corresponding intervals are comparable under theinclusion relation. Graphs admitting an interval containment modelare called containment interval graphs or CI graphs for short. Avertex v of a CI graph G is an end-vertex if there is an intervalcontainment model of G in which the left endpoint of the intervalcorresponding to v is less than all other endpoints. In this work,we present a characterization of end-vertices in terms of forbiddeninduced subgraphs.
Fil: Alcón, Liliana Graciela. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina
Fil: Gudiño, Noemí Amalia. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina
Fil: Gutierrez, Marisa. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina
description An interval containment model of a graph maps vertices intointervals of a line in such a way that two vertices are adjacent ifand only if the corresponding intervals are comparable under theinclusion relation. Graphs admitting an interval containment modelare called containment interval graphs or CI graphs for short. Avertex v of a CI graph G is an end-vertex if there is an intervalcontainment model of G in which the left endpoint of the intervalcorresponding to v is less than all other endpoints. In this work,we present a characterization of end-vertices in terms of forbiddeninduced subgraphs.
publishDate 2017
dc.date.none.fl_str_mv 2017-11
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/75962
Alcón, Liliana Graciela; Gudiño, Noemí Amalia; Gutierrez, Marisa; End vertices in containment interval graphs; Sociedade Brasileira de Matematica; Matematica Contemporanea; 45; 11-2017; 86-96
0103-9059
CONICET Digital
CONICET
url http://hdl.handle.net/11336/75962
identifier_str_mv Alcón, Liliana Graciela; Gudiño, Noemí Amalia; Gutierrez, Marisa; End vertices in containment interval graphs; Sociedade Brasileira de Matematica; Matematica Contemporanea; 45; 11-2017; 86-96
0103-9059
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://mc.sbm.org.br/wp-content/uploads/sites/15/2018/12/45-11.pdf
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 Sociedade Brasileira de Matematica
publisher.none.fl_str_mv Sociedade Brasileira de Matematica
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_ 1844614507834376192
score 13.070432

Publicaciones similares