dc.creatorAlcón, Liliana Graciela
dc.creatorGudiño, Noemí Amalia
dc.creatorGutierrez, Marisa
dc.date.accessioned2019-09-23T19:36:39Z
dc.date.accessioned2022-10-15T11:40:06Z
dc.date.available2019-09-23T19:36:39Z
dc.date.available2022-10-15T11:40:06Z
dc.date.created2019-09-23T19:36:39Z
dc.date.issued2018-08
dc.identifierAlcón, Liliana Graciela; Gudiño, Noemí Amalia; Gutierrez, Marisa; Recent results on containment graphs of paths in a tree; Elsevier Science; Discrete Applied Mathematics; 245; 8-2018; 139-147
dc.identifier0166-218X
dc.identifierhttp://hdl.handle.net/11336/84186
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4381901
dc.description.abstractIn this paper, motivated by the questions posed by Spinrad in Spinrad (2003) and Golumbic and Trenk (2004), we investigate those posets that admit a containment model mapping vertices into paths of a tree and their comparability graphs, named CPT posets and CPT graphs, respectively. We present a necessary condition to be CPT and prove it is not sufficient. We provide further examples of CPT posets P whose dual Pd is non CPT. Thus, we introduce the notion of dually-CPT and strong-CPT posets. We demonstrate that, unlike what happens with posets admitting a containment model using interval of the line, the dimension and the interval dimension of CPT posets is unbounded. On the other hand, we find that the dimension of a CPT poset is at most the number of leaves of the tree used in the containment model. We give a characterization of CPT (also dually-CPT and strong-CPT) split posets by a family of forbidden subposets. We prove that every tree is strong-CPT.
dc.languageeng
dc.publisherElsevier Science
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.dam.2018.04.009
dc.relationinfo:eu-repo/semantics/altIdentifier/url/sciencedirect.com/science/article/pii/S0166218X18302191
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectComparability Graphs
dc.subjectGeometric Containment Models
dc.subjectPosets
dc.titleRecent results on containment graphs of paths in a tree
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución