On (k,ℓ)-Leaf Powers

DOI10.1007/978-3-540-74456-6_47zbMath1147.68601OpenAlexW1491116874MaRDI QIDQ3525598

Andreas Brandstädt, Peter Wagner

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_47

zbMATH Keywords

linear time algorithmsstrictly chordal graphsleaf powersleaf roots(\(k, \ell\))-leaf powers

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (11)

Towards a characterization of leaf powers by clique arrangements ⋮ Recognizing k -Leaf Powers in Polynomial Time, for Constant k ⋮ Boxicity of leaf powers ⋮ Characterising \((k,\ell )\)-leaf powers ⋮ Linear time construction of 5-phylogenetic roots for tree chordal graphs ⋮ Ptolemaic Graphs and Interval Graphs Are Leaf Powers ⋮ The NLC-width and clique-width for powers of graphs of bounded tree-width ⋮ Simplicial powers of graphs ⋮ The complete inclusion structure of leaf power classes ⋮ Simplicial Powers of Graphs ⋮ On k- Versus (k + 1)-Leaf Powers

This page was built for publication: On (k,ℓ)-Leaf Powers