The complete inclusion structure of leaf power classes

DOI10.1016/J.TCS.2009.06.031MaRDI QIDQ1040592zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On k- Versus (k + 1)-Leaf Powers
• Characterising \((k,\ell )\)-leaf powers
• On (k,ℓ)-Leaf Powers
• Rooted directed path graphs are leaf powers
• A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers

Cites work

• scientific article; zbMATH DE number 2080275 (Why is no real title available?)
• A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
• A note on the metric properties of trees
• Algorithms and Computation
• Error compensation in leaf power problems
• Leaf Powers and Their Properties: Using the Trees
• On (k,ℓ)-Leaf Powers
• On graph powers for leaf-labeled trees
• On k- Versus (k + 1)-Leaf Powers
• Some remarks about leaf roots
• Strictly chordal graphs are leaf powers
• Structure and linear time recognition of 3-leaf powers
• The 3-Steiner Root Problem

Cited in

(3)

• Pairwise compatibility graphs: a survey
• Computing optimal leaf roots of chordal cographs in linear time
• On k- Versus (k + 1)-Leaf Powers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040592)