Asteroidal quadruples in non rooted path graphs

dc.creatorGutierrez, Marisa
dc.creatorLeveque, Benjamin
dc.creatorTondato, Silvia Beatriz
dc.date.accessioned2018-05-23T13:50:43Z
dc.date.available2018-05-23T13:50:43Z
dc.date.created2018-05-23T13:50:43Z
dc.date.issued2015-01
dc.identifierGutierrez, Marisa; Leveque, Benjamin; Tondato, Silvia Beatriz; Asteroidal quadruples in non rooted path graphs; Discussiones Mathematicae Graph Theory; Discussiones Mathematicae Graph Theory; 35; 4; 1-2015; 603-614
dc.identifier2083-5892
dc.identifierhttp://hdl.handle.net/11336/45977
dc.identifierCONICET Digital
dc.identifierCONICET
dc.description.abstractA directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to find such characterizations for rooted path graphs. For this purpose, we are studying in this paper directed path graphs that are non rooted path graphs. We prove that such graphs always contain an asteroidal quadruple.
dc.languageeng
dc.publisherDiscussiones Mathematicae Graph Theory
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/https://dx.doi.org/10.7151/dmgt.1821
dc.relationinfo:eu-repo/semantics/altIdentifier/url/http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1821
dc.rightshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectClique Trees
dc.subjectRooted Path Graphs
dc.subjectAsteroidal Quadruples
dc.titleAsteroidal quadruples in non rooted path graphs
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