Some remarks about leaf roots

DOI10.1016/J.DISC.2006.03.030MaRDI QIDQ2497485zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Structure and linear-time recognition of 4-leaf powers
• On (k,ℓ)-Leaf Powers
• Characterising \((k,\ell )\)-leaf powers
• Structure and linear time recognition of 3-leaf powers
• Exact leaf powers

Cites work

• On graph powers for leaf-labeled trees
• The intersection graphs of subtrees in trees are exactly the chordal graphs

Cited in

(26)

• scientific article; zbMATH DE number 7559376 (Why is no real title available?)
• Cycle Extendability of Hamiltonian Strongly Chordal Graphs
• A polynomial kernel for 3-leaf power deletion
• Recognizing k -Leaf Powers in Polynomial Time, for Constant k
• Exact leaf powers
• Simplicial powers of graphs
• Pairwise compatibility graphs: a survey
• The Clique-Width of Tree-Power and Leaf-Power Graphs
• n-leaf and star n-leaf
• Lower bounds for leaf rank of leaf powers
• Characterising \((k,\ell )\)-leaf powers
• Maximal determinants of combinatorial matrices
• Linear time construction of 5-phylogenetic roots for tree chordal graphs
• Closest 4-leaf power is fixed-parameter tractable
• The NLC-width and clique-width for powers of graphs of bounded tree-width
• Parameterized leaf power recognition via embedding into graph products
• The complete inclusion structure of leaf power classes
• Ptolemaic Graphs and Interval Graphs Are Leaf Powers
• On k- Versus (k + 1)-Leaf Powers
• Simplicial Powers of Graphs
• Parameterized leaf power recognition via embedding into graph products
• Structure and linear time recognition of 3-leaf powers
• Rooted directed path graphs are leaf powers
• A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
• On extremal leaf status and internal status
• Pairwise compatibility graphs: complete characterization for wheels

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

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