A characterization of substar graphs
From MaRDI portal
Abstract: The intersection graphs of stars in some tree are known as substar graphs. In this paper we give a characterization of substar graphs by the list of minimal forbidden induced subgraphs. This corrects a flaw in the main result of Chang, Jacobson, Monma and West (Subtree and substar intersection numbers, Discrete Appl. Math. 44, 205-220 (1993)) and this leads to a different list of minimal forbidden induced subgraphs.
Recommendations
Cites work
- A recognition algorithm for the intersection graphs of paths in trees
- Betweenness, orders and interval graphs
- Characterizing intersection graphs of substars of a star.
- Graph Classes: A Survey
- Intersection graphs of paths in a tree
- Subtree and substar intersection numbers
- The intersection graphs of subtrees in trees are exactly the chordal graphs
Cited in
(6)
This page was built for publication: A characterization of substar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401150)