From path graphs to directed path graphs
From MaRDI portal
Recommendations
Cites work
- A faster algorithm to recognize undirected path graphs
- A recognition algorithm for the intersection graphs of paths in trees
- Algorithmic graph theory and perfect graphs
- Characterizing path graphs by forbidden induced subgraphs
- Incidence matrices and interval graphs
- Intersection graphs of paths in a tree
- The forbidden subgraph characterization of directed vertex graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Topics in Intersection Graph Theory
Cited in
(9)- On models of directed path graphs non rooted directed path graphs
- Isomorphisms and traversability of directed path graphs
- scientific article; zbMATH DE number 3893233 (Why is no real title available?)
- scientific article; zbMATH DE number 5879503 (Why is no real title available?)
- scientific article; zbMATH DE number 4183442 (Why is no real title available?)
- Intersection graphs of non-crossing paths
- Two new characterizations of path graphs
- Simpler and unified recognition algorithm for path graphs and directed path graphs
- Asteroidal quadruples in non rooted path graphs
This page was built for publication: From path graphs to directed path graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3057630)