| dc.creator | Alcón, Liliana Graciela | |
| dc.creator | Gudiño, Noemí Amalia | |
| dc.creator | Gutiérrez, Marisa | |
| dc.date | 2020-08-22 | |
| dc.date | 2022-07-07T18:03:17Z | |
| dc.date.accessioned | 2023-07-15T05:14:12Z | |
| dc.date.available | 2023-07-15T05:14:12Z | |
| dc.identifier | http://sedici.unlp.edu.ar/handle/10915/139126 | |
| dc.identifier | issn:0167-8094 | |
| dc.identifier | issn:1572-9273 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/7472598 | |
| dc.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. | |
| dc.description | Centro de Investigación de Matemática | |
| dc.format | application/pdf | |
| dc.format | 229-244 | |
| dc.language | en | |
| dc.rights | http://creativecommons.org/licenses/by/4.0/ | |
| dc.rights | Creative Commons Attribution 4.0 International (CC BY 4.0) | |
| dc.subject | Matemática | |
| dc.subject | Containment models | |
| dc.subject | Comparability graphs | |
| dc.subject | k-trees | |
| dc.subject | CPT posets | |
| dc.title | On k-tree Containment Graphs of Paths in a Tree | |
| dc.type | Articulo | |
| dc.type | Articulo | |
