Some remarks about leaf roots

DOI10.1016/j.disc.2006.03.030zbMath1095.68087MaRDI QIDQ2497485

Dieter Rautenbach

Publication date: 4 August 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.030

zbMATH Keywords

forbidden induced subgraph; leaf root

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

Ptolemaic Graphs and Interval Graphs Are Leaf Powers, Simplicial Powers of Graphs, On k- Versus (k + 1)-Leaf Powers, Towards a characterization of leaf powers by clique arrangements, Structure and linear time recognition of 3-leaf powers, Rooted directed path graphs are leaf powers, Characterising \((k,\ell )\)-leaf powers, Exact leaf powers, Closest 4-leaf power is fixed-parameter tractable, The NLC-width and clique-width for powers of graphs of bounded tree-width, Simplicial powers of graphs, The complete inclusion structure of leaf power classes, A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers, Linear time construction of 5-phylogenetic roots for tree chordal graphs, Pairwise Compatibility Graphs: A Survey, The Clique-Width of Tree-Power and Leaf-Power Graphs

Cites Work

• The intersection graphs of subtrees in trees are exactly the chordal graphs
• On Graph Powers for Leaf-Labeled Trees