Convex geometries over induced paths with bounded length

Autor: Gutierrez, Marisa, Protti, Fábio, Tondato, Silvia B.

Graph convexity spaces have been studied in many contexts. In particular, some studies are devoted to determine if a graph equipped with a convexity space is a {\em convex geometry}. It is well known that chordal and Ptolemaic graphs can be character

Externí odkaz: http://arxiv.org/abs/2203.05588

Convex geometries over induced paths with bounded length

Autor: Gutierrez, Marisa, Protti, Fábio, Tondato, Silvia B.

Publikováno v: In Discrete Mathematics January 2023 346(1)

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Asteroidal Quadruples in non Rooted Path Graphs

Autor: Gutierrez Marisa, Lévêque Benjamin, Tondato Silvia B.

Publikováno v: Discussiones Mathematicae Graph Theory, Vol 35, Iss 4, Pp 603-614 (2015)

A 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

Externí odkaz: https://doaj.org/article/0c738a5f000749e7b3af76592e83250b

From Path Graphs to Directed Path Graphs

Autor: Chaplick, Steven, Gutierrez, Marisa, Lévêque, Benjamin, Tondato, Silvia B., Thilikos, D.M.

Publikováno v: 36th International Workshop on Graph-Theoretic Concepts in Computer Science
WG: Workshop on Graph Theoretic Concepts in Computer Science
WG: Workshop on Graph Theoretic Concepts in Computer Science, Jun 2010, Zarós, Greece. pp.256-265, ⟨10.1007/978-3-642-16926-7_24⟩
Graph Theoretic Concepts in Computer Science ISBN: 9783642169250
WG
Graph Theoretic Concepts in Computer Science. WG 2010, 256-265
STARTPAGE=256;ENDPAGE=265;TITLE=Graph Theoretic Concepts in Computer Science. WG 2010

We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to find an odd sun when the method fails. This algorithm has several intere

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::910edb125f1b3ccac6d0a1c0fdb7d9aa
https://doi.org/10.1007/978-3-642-16926-7_24