Characterizing directed path graphs by forbidden asteroids
From MaRDI portal
Recommendations
Cites work
- A recognition algorithm for the intersection graphs of paths in trees
- Algorithmic graph theory and perfect graphs
- Asteroids in rooted and directed path graphs
- Characterizing path graphs by forbidden induced subgraphs
- Graph Classes: A Survey
- scientific article; zbMATH DE number 3152801 (Why is no real title available?)
- Incidence matrices and interval graphs
- Intersection graphs of paths in a tree
- Representation of a finite graph by a set of intervals on the real line
- Some remarks on interval graphs
- The forbidden subgraph characterization of directed vertex graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The leafage of a chordal graph
- Topics in Intersection Graph Theory
Cited in
(6)- Asteroids in rooted and directed path graphs
- On models of directed path graphs non rooted directed path graphs
- On rooted directed path graphs
- Two new characterizations of path graphs
- Forbidden subgraph characterization of extended star directed path graphs that are not rooted directed path graphs
- Asteroidal quadruples in non rooted path graphs
This page was built for publication: Characterizing directed path graphs by forbidden asteroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174239)