Leaf Powers and Their Properties: Using the Trees

DOI10.1007/978-3-540-92182-0_37MaRDI QIDQ3596736zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michael R. Fellows, Daniel Meister, Frances Rosamond, R. Sritharan, Jan Arne Telle

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92182-0_37

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1617253
• On graph powers for leaf-labeled trees
• Exact leaf powers
• On k- Versus (k + 1)-Leaf Powers
• Characterising \((k,\ell )\)-leaf powers

Cited in

(12)

• The complete inclusion structure of leaf power classes
• New results on pairwise compatibility graphs
• Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees
• On graphs that are not PCGs
• The Clique-Width of Tree-Power and Leaf-Power Graphs
• Cycle Extendability of Hamiltonian Strongly Chordal Graphs
• Parameterized leaf power recognition via embedding into graph products
• On k-trees with given leafages
• On generalizations of pairwise compatibility graphs
• Parameterized leaf power recognition via embedding into graph products
• Characterising \((k,\ell )\)-leaf powers
• Exact leaf powers

This page was built for publication: Leaf Powers and Their Properties: Using the Trees

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