On k-tree Containment Graphs of Paths in a Tree
- Autores
- Alcón, Liliana Graciela; Gudiño, Noemí Amalia; Gutiérrez, Marisa
- Año de publicación
- 2020
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- A k-tree is either a complete graph on k vertices or a graph that contains a vertex whose neighborhood induces a complete graph on k vertices and whose removal results in a k-tree. If the comparability graph of a poset P is a k-tree, we say that P is a k-tree poset. In the present work, we study and characterize by forbidden subposets the k-tree posets that admit a containment model mapping vertices into paths of a tree (CPT k-tree posets). Furthermore, we characterize the dually-CPT and strong-CPT k-tree posets and their comparability graphs. The characterizations lead to efficient recognition algorithms for the respective classes.
Centro de Investigación de Matemática - Materia
-
Matemática
Containment models
Comparability graphs
k-trees
CPT posets - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by/4.0/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/139126
Ver los metadatos del registro completo
| id |
SEDICI_9310750ced0b41c43563d282b42c6303 |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/139126 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
On k-tree Containment Graphs of Paths in a TreeAlcón, Liliana GracielaGudiño, Noemí AmaliaGutiérrez, MarisaMatemáticaContainment modelsComparability graphsk-treesCPT posetsA k-tree is either a complete graph on k vertices or a graph that contains a vertex whose neighborhood induces a complete graph on k vertices and whose removal results in a k-tree. If the comparability graph of a poset P is a k-tree, we say that P is a k-tree poset. In the present work, we study and characterize by forbidden subposets the k-tree posets that admit a containment model mapping vertices into paths of a tree (CPT k-tree posets). Furthermore, we characterize the dually-CPT and strong-CPT k-tree posets and their comparability graphs. The characterizations lead to efficient recognition algorithms for the respective classes.Centro de Investigación de Matemática2020-08-22info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf229-244http://sedici.unlp.edu.ar/handle/10915/139126enginfo:eu-repo/semantics/altIdentifier/issn/0167-8094info:eu-repo/semantics/altIdentifier/issn/1572-9273info:eu-repo/semantics/altIdentifier/doi/10.1007/s11083-020-09536-1info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/4.0/Creative Commons Attribution 4.0 International (CC BY 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:32:37Zoai:sedici.unlp.edu.ar:10915/139126Institucionalhttp://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:32:37.886SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
On k-tree Containment Graphs of Paths in a Tree |
| title |
On k-tree Containment Graphs of Paths in a Tree |
| spellingShingle |
On k-tree Containment Graphs of Paths in a Tree Alcón, Liliana Graciela Matemática Containment models Comparability graphs k-trees CPT posets |
| title_short |
On k-tree Containment Graphs of Paths in a Tree |
| title_full |
On k-tree Containment Graphs of Paths in a Tree |
| title_fullStr |
On k-tree Containment Graphs of Paths in a Tree |
| title_full_unstemmed |
On k-tree Containment Graphs of Paths in a Tree |
| title_sort |
On k-tree Containment Graphs of Paths in a Tree |
| 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 Containment models Comparability graphs k-trees CPT posets |
| topic |
Matemática Containment models Comparability graphs k-trees CPT posets |
| dc.description.none.fl_txt_mv |
A k-tree is either a complete graph on k vertices or a graph that contains a vertex whose neighborhood induces a complete graph on k vertices and whose removal results in a k-tree. If the comparability graph of a poset P is a k-tree, we say that P is a k-tree poset. In the present work, we study and characterize by forbidden subposets the k-tree posets that admit a containment model mapping vertices into paths of a tree (CPT k-tree posets). Furthermore, we characterize the dually-CPT and strong-CPT k-tree posets and their comparability graphs. The characterizations lead to efficient recognition algorithms for the respective classes. Centro de Investigación de Matemática |
| description |
A k-tree is either a complete graph on k vertices or a graph that contains a vertex whose neighborhood induces a complete graph on k vertices and whose removal results in a k-tree. If the comparability graph of a poset P is a k-tree, we say that P is a k-tree poset. In the present work, we study and characterize by forbidden subposets the k-tree posets that admit a containment model mapping vertices into paths of a tree (CPT k-tree posets). Furthermore, we characterize the dually-CPT and strong-CPT k-tree posets and their comparability graphs. The characterizations lead to efficient recognition algorithms for the respective classes. |
| publishDate |
2020 |
| dc.date.none.fl_str_mv |
2020-08-22 |
| 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/139126 |
| url |
http://sedici.unlp.edu.ar/handle/10915/139126 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/issn/0167-8094 info:eu-repo/semantics/altIdentifier/issn/1572-9273 info:eu-repo/semantics/altIdentifier/doi/10.1007/s11083-020-09536-1 |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/4.0/ Creative Commons Attribution 4.0 International (CC BY 4.0) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by/4.0/ Creative Commons Attribution 4.0 International (CC BY 4.0) |
| dc.format.none.fl_str_mv |
application/pdf 229-244 |
| 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_ |
1844616205565952000 |
| score |
13.070432 |