On k- Versus (k + 1)-Leaf Powers

DOI10.1007/978-3-540-85097-7_16MaRDI QIDQ5505655zbMATH OpenOpenAlexFDO

Authors Andreas Brandstädt, Peter Wagner

Publication date 27 January 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85097-7_16

zbMATH Keywords

\(k\)-leaf powersintersection of leaf power classescomparability of leaf power classes

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The complete inclusion structure of leaf power classes
• Characterising \((k,\ell )\)-leaf powers
• On (k,ℓ)-Leaf Powers
• Structure and linear-time recognition of 4-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 note on the metric properties of trees
• Algorithms and Computation
• Algorithms and Computation
• Distance-Hereditary 5-Leaf Powers
• Exact leaf powers
• On (k,ℓ)-Leaf Powers
• On graph powers for leaf-labeled trees
• Some remarks about leaf roots
• Strictly chordal graphs are leaf powers
• Structure and linear time recognition of 3-leaf powers
• Structure and linear-time recognition of 4-leaf powers
• The 3-Steiner Root Problem

Cited in

(12)

• Recognition of linear and star variants of leaf powers is in P
• Recognizing k -Leaf Powers in Polynomial Time, for Constant k
• Pairwise compatibility graphs: a survey
• On (k,ℓ)-Leaf Powers
• Characterising \((k,\ell )\)-leaf powers
• Parameterized leaf power recognition via embedding into graph products
• The complete inclusion structure of leaf power classes
• Leaf Powers and Their Properties: Using the Trees
• Parameterized leaf power recognition via embedding into graph products
• Structure and linear time recognition of 3-leaf powers
• Rooted directed path graphs are leaf powers
• A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers

This page was built for publication: On k- Versus (k + 1)-Leaf Powers

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