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

DOI10.1007/978-3-540-85097-7_16zbMath1168.05342OpenAlexW1826682349MaRDI QIDQ5505655

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

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

Related Items

Pairwise Compatibility Graphs: A Survey ⋮ Towards a characterization of leaf powers by clique arrangements ⋮ Recognizing k -Leaf Powers in Polynomial Time, for Constant k ⋮ 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 ⋮ Parameterized leaf power recognition via embedding into graph products

Cites Work

• Unnamed Item
• Structure and linear time recognition of 3-leaf powers
• Strictly chordal graphs are leaf powers
• Exact leaf powers
• A note on the metric properties of trees
• Some remarks about leaf roots
• On Graph Powers for Leaf-Labeled Trees
• Distance-Hereditary 5-Leaf Powers
• The 3-Steiner Root Problem
• On (k,ℓ)-Leaf Powers
• Structure and linear-time recognition of 4-leaf powers
• Algorithms and Computation
• Algorithms and Computation