The complete inclusion structure of leaf power classes

DOI10.1016/j.tcs.2009.06.031zbMath1184.68363OpenAlexW2014770164MaRDI QIDQ1040592

Peter Wagner, Andreas Brandstädt

Publication date: 25 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.031

zbMATH Keywords

\(k\)-leaf powersinclusion comparability of leaf power classesintersection of leaf power classes

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Protein sequences, DNA sequences (92D20) Structural characterization of families of graphs (05C75)

Related Items (1)

Pairwise Compatibility Graphs: A Survey

Cites Work

• Unnamed Item
• Structure and linear time recognition of 3-leaf powers
• Strictly chordal graphs are leaf powers
• A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
• A note on the metric properties of trees
• Some remarks about leaf roots
• Error compensation in leaf power problems
• On Graph Powers for Leaf-Labeled Trees
• The 3-Steiner Root Problem
• On (k,ℓ)-Leaf Powers
• Leaf Powers and Their Properties: Using the Trees
• On k- Versus (k + 1)-Leaf Powers
• Algorithms and Computation

This page was built for publication: The complete inclusion structure of leaf power classes