Abstract
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted directed path graph is the intersection graph of a family of directed subpaths of a rooted tree. Clearly, rooted directed 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 directed path graphs. With the purpose of proving knowledge in this direction, we show in this paper properties of directed path models that can not be rooted for chordal graphs with any leafage and with leafage four. Therefore, we prove that for leafage four directed path graphs minimally non rooted directed path graphs have a unique asteroidal quadruple, and can be characterized by the presence of certain type of asteroidal quadruples.
Similar content being viewed by others
References
Cameron, K., Hoáng, C.T., Lévêque, B.: Asteroids in rooted and directed path graphs. Electron. Notes Discrete Math. 32, 67–74 (2009)
Cameron, K., Hoáng, C.T., Lévêque, B.: Characterizing directed path graphs by forbidden asteroids. J. Graph Theory 68, 103–112 (2011)
Chaplick, S., Stacho, J.: The vertex leafage of chordal graphs. Discrete Appl. Math. 168, 14–25 (2014)
Chaplick, S., Gutierrez, M., Lévêque, B., Tondato, S.B.: From path graphs to directed path graphs, WG’10. Lecture Notes Comput. Sci. 6410, 256–265 (2010)
Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combin. Theory B 16, 47–56 (1974)
Gutierrez, M., Lévêque, B., Tondato, S.B.: Asteroidal quadruples in non rooted path graphs. Discussiones Mathematicae Graph Theory (2014, accepted)
Gutierrez, M., Tondato, S.B.: On path models of path graphs (2011)
Lekkerkerker, C.G., Boland, J.Ch.: Representation of finite graph by a set of intervals on the real line. Fundam. Math. Li, 45–64 (1962)
Lévêque, B., Maffray, F., Preissmann, M.: Characterizing path graphs by forbidden induced subgraphs. J. Graph Theory 62, 369–384 (2009)
Lin, I., McKee, T., West, D.B.: The leafage of a chordal graphs. Discuss. Math. Graph Theory 18, 23–48 (1998)
Monma, C., Wei, V.: Intersection graphs of paths in a tree. J. Combin. Theory B 41, 141–181 (1986)
Panda, B.S.: The forbidden subgraph characterization of directed vertex graphs. Discrete Math. 196, 239–256 (1999)
Acknowledgments
We thank referees for their comments and suggestions which improved the presentation of the earlier draft of this article.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gutierrez, M., Tondato, S.B. On Models of Directed Path Graphs Non Rooted Directed Path Graphs. Graphs and Combinatorics 32, 663–684 (2016). https://doi.org/10.1007/s00373-015-1600-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-015-1600-z