A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
From MaRDI portal
Publication:1043551
DOI10.1016/j.disc.2008.10.025zbMath1221.05040MaRDI QIDQ1043551
Dieter Rautenbach, Van Bang Le, Andreas Brandstädt
Publication date: 9 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.10.025
Related Items
Parameterized Leaf Power Recognition via Embedding into Graph Products, Simplicial Powers of Graphs, Recognizing k -Leaf Powers in Polynomial Time, for Constant k, Towards a characterization of leaf powers by clique arrangements, Parameterized leaf power recognition via embedding into graph products, Rooted directed path graphs are leaf powers, Characterising \((k,\ell )\)-leaf powers, The complete inclusion structure of leaf power classes, Maximal determinants of combinatorial matrices, Pairwise Compatibility Graphs: A Survey
Cites Work
- Unnamed Item
- Unnamed Item
- Structure and linear time recognition of 3-leaf powers
- Strictly chordal graphs are leaf powers
- Distance-hereditary graphs
- Some remarks about leaf roots
- Error compensation in leaf power problems
- On Graph Powers for Leaf-Labeled Trees
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Graph Classes: A Survey
- Computing Phylogenetic Roots with Bounded Degrees and Errors