End vertices in containment interval graphs

Autores
Alcón, Liliana Graciela; Gudiño, Noemí Amalia; Gutiérrez, 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 into intervals of a line in such a way that two vertices are adjacent if and only if the corresponding intervals are comparable under the inclusion relation. Graphs admitting an interval containment model are called containment interval graphs or CI graphs for short. A vertex v of a CI graph G is an end-vertex if there is an interval containment model of G in which the left endpoint of the interval corresponding to v is less than all other endpoints. In this work,we present a characterization of end-vertices in terms of forbidden induced subgraphs.
Facultad de Ciencias Exactas
Consejo Nacional de Investigaciones Científicas y Técnicas
Materia
Matemática
End vertices
Contaiment
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/96293
Acceder
id SEDICI_a5008ae56884d44e2e34a8bfc3fe02a7
oai_identifier_str oai:sedici.unlp.edu.ar:10915/96293
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling End vertices in containment interval graphsAlcón, Liliana GracielaGudiño, Noemí AmaliaGutiérrez, MarisaMatemáticaEnd verticesContaimentAn interval containment model of a graph maps vertices into intervals of a line in such a way that two vertices are adjacent if and only if the corresponding intervals are comparable under the inclusion relation. Graphs admitting an interval containment model are called containment interval graphs or CI graphs for short. A vertex v of a CI graph G is an end-vertex if there is an interval containment model of G in which the left endpoint of the interval corresponding to v is less than all other endpoints. In this work,we present a characterization of end-vertices in terms of forbidden induced subgraphs.Facultad de Ciencias ExactasConsejo Nacional de Investigaciones Científicas y Técnicas2017-11info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf86-96http://sedici.unlp.edu.ar/handle/10915/96293enginfo:eu-repo/semantics/altIdentifier/url/https://ri.conicet.gov.ar/11336/75962info:eu-repo/semantics/altIdentifier/url/http://mc.sbm.org.br/wp-content/uploads/sites/15/2018/12/45-11.pdfinfo:eu-repo/semantics/altIdentifier/issn/0103-9059info:eu-repo/semantics/altIdentifier/hdl/11336/75962info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:20:21Zoai:sedici.unlp.edu.ar:10915/96293Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:20:22.192SEDICI (UNLP) - Universidad Nacional de La Platafalse
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
Matemática
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
Gutiérrez, Marisa
author Alcón, Liliana Graciela
author_facet Alcón, Liliana Graciela
Gudiño, Noemí Amalia
Gutiérrez, Marisa
author_role author
author2 Gudiño, Noemí Amalia
Gutiérrez, Marisa
author2_role author
author
dc.subject.none.fl_str_mv Matemática
End vertices
Contaiment
topic Matemática
End vertices
Contaiment
dc.description.none.fl_txt_mv An interval containment model of a graph maps vertices into intervals of a line in such a way that two vertices are adjacent if and only if the corresponding intervals are comparable under the inclusion relation. Graphs admitting an interval containment model are called containment interval graphs or CI graphs for short. A vertex v of a CI graph G is an end-vertex if there is an interval containment model of G in which the left endpoint of the interval corresponding to v is less than all other endpoints. In this work,we present a characterization of end-vertices in terms of forbidden induced subgraphs.
Facultad de Ciencias Exactas
Consejo Nacional de Investigaciones Científicas y Técnicas
description An interval containment model of a graph maps vertices into intervals of a line in such a way that two vertices are adjacent if and only if the corresponding intervals are comparable under the inclusion relation. Graphs admitting an interval containment model are called containment interval graphs or CI graphs for short. A vertex v of a CI graph G is an end-vertex if there is an interval containment model of G in which the left endpoint of the interval corresponding to v is less than all other endpoints. In this work,we present a characterization of end-vertices in terms of forbidden induced 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
Articulo
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://sedici.unlp.edu.ar/handle/10915/96293
url http://sedici.unlp.edu.ar/handle/10915/96293
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://ri.conicet.gov.ar/11336/75962
info:eu-repo/semantics/altIdentifier/url/http://mc.sbm.org.br/wp-content/uploads/sites/15/2018/12/45-11.pdf
info:eu-repo/semantics/altIdentifier/issn/0103-9059
info:eu-repo/semantics/altIdentifier/hdl/11336/75962
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
86-96
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844616078311817216
score 13.070432

Publicaciones similares