From Path Graphs to Directed Path Graphs

DOI10.1007/978-3-642-16926-7_24zbMath1310.05196OpenAlexW1496800439MaRDI QIDQ3057630

Steven Chaplick, Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato

Publication date: 16 November 2010

Published in: Graph Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00620726/file/From_Path_Graphs_to_Directed_Path_Graphs.pdf

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

On models of directed path graphs non rooted directed path graphs ⋮ Asteroidal quadruples in non rooted path graphs ⋮ Two new characterizations of path graphs ⋮ Intersection graphs of non-crossing paths

Cites Work

• Intersection graphs of paths in a tree
• A recognition algorithm for the intersection graphs of paths in trees
• The forbidden subgraph characterization of directed vertex graphs
• Algorithmic graph theory and perfect graphs
• A faster algorithm to recognize undirected path graphs
• Incidence matrices and interval graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Characterizing path graphs by forbidden induced subgraphs
• Topics in Intersection Graph Theory

This page was built for publication: From Path Graphs to Directed Path Graphs