Leaf Powers and Their Properties: Using the Trees

DOI10.1007/978-3-540-92182-0_37zbMATH Open1183.68425DBLPconf/isaac/FellowsMRST08OpenAlexW1831098006WikidataQ57359893 ScholiaQ57359893MaRDI QIDQ3596736FDOQ3596736

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

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

Mathematics Subject Classification ID

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

Cited In (11)

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

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)