Characterizing directed path graphs by forbidden asteroids
From MaRDI portal
Publication:3174239
DOI10.1002/JGT.20543zbMATH Open1230.05139OpenAlexW2101313002MaRDI QIDQ3174239FDOQ3174239
Authors: Kathie Cameron, Benjamin Lévêque, Chính T. Hoàng 
Publication date: 12 October 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20543
Recommendations
Cites Work
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- Intersection graphs of paths in a tree
- Algorithmic graph theory and perfect graphs
- Incidence matrices and interval graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Representation of a finite graph by a set of intervals on the real line
- Characterizing path graphs by forbidden induced subgraphs
- Title not available (Why is that?)
- The forbidden subgraph characterization of directed vertex graphs
- Asteroids in rooted and directed path graphs
- The leafage of a chordal graph
- A recognition algorithm for the intersection graphs of paths in trees
- Some remarks on interval graphs
Cited In (6)
- On models of directed path graphs non rooted directed path graphs
- Two new characterizations of path graphs
- Asteroidal quadruples in non rooted path graphs
- On rooted directed path graphs
- Forbidden subgraph characterization of extended star directed path graphs that are not rooted directed path graphs
- Asteroids in rooted and directed 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)
