Some remarks about leaf roots

DOI10.1016/j.disc.2006.03.030zbMath1095.68087OpenAlexW1965269869MaRDI QIDQ2497485

Dieter Rautenbach

Publication date: 4 August 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.030

zbMATH Keywords

forbidden induced subgraphleaf root

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (24)

Structure and linear time recognition of 3-leaf powers ⋮ Maximal determinants of combinatorial matrices ⋮ Pairwise Compatibility Graphs: A Survey ⋮ Towards a characterization of leaf powers by clique arrangements ⋮ A polynomial kernel for 3-leaf power deletion ⋮ Recognizing k -Leaf Powers in Polynomial Time, for Constant k ⋮ Pairwise compatibility graphs: complete characterization for wheels ⋮ The Clique-Width of Tree-Power and Leaf-Power Graphs ⋮ Parameterized Leaf Power Recognition via Embedding into Graph Products ⋮ Rooted directed path graphs are leaf powers ⋮ Characterising \((k,\ell )\)-leaf powers ⋮ Linear time construction of 5-phylogenetic roots for tree chordal graphs ⋮ Exact leaf powers ⋮ Unnamed Item ⋮ Closest 4-leaf power is fixed-parameter tractable ⋮ Cycle Extendability of Hamiltonian Strongly 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 ⋮ A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers ⋮ Parameterized leaf power recognition via embedding into graph products ⋮ Simplicial Powers of Graphs ⋮ On k- Versus (k + 1)-Leaf Powers

Cites Work

• The intersection graphs of subtrees in trees are exactly the chordal graphs
• On Graph Powers for Leaf-Labeled Trees

This page was built for publication: Some remarks about leaf roots