Leaf Powers and Their Properties: Using the Trees
From MaRDI portal
Publication:3596736
DOI10.1007/978-3-540-92182-0_37zbMath1183.68425OpenAlexW1831098006WikidataQ57359893 ScholiaQ57359893MaRDI QIDQ3596736
Jan Arne Telle, R. Sritharan, Michael R. Fellows, Daniel Meister, Frances A. Rosamond
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
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Related Items (6)
New results on pairwise compatibility graphs ⋮ Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees ⋮ Characterising \((k,\ell )\)-leaf powers ⋮ On graphs that are not PCGs ⋮ Cycle Extendability of Hamiltonian Strongly Chordal Graphs ⋮ The complete inclusion structure of leaf power classes
This page was built for publication: Leaf Powers and Their Properties: Using the Trees
