Lower bounds for leaf rank of leaf powers

DOI10.1007/978-3-031-63021-7_26MaRDI QIDQ7021083zbMATH OpenFDO

Authors Svein Høgemo

Publication date 28 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-63021-7_26

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• Algorithmic graph theory and perfect graphs
• Computing Optimal Leaf Roots of Chordal Cographs in Linear Time
• Error compensation in leaf power problems
• Exact leaf powers
• scientific article; zbMATH DE number 2080275 (Why is no real title available?)
• Leaf powers
• Lower bounds on the mim-width of some graph classes
• Mim-width. III. Graph powers and generalized distance domination problems
• Neighborhood subtree tolerance graphs
• On graph powers for leaf-labeled trees
• On strongly chordal graphs that are not leaf powers
• Recognition of linear and star variants of leaf powers is in P
• Recognizing k -Leaf Powers in Polynomial Time, for Constant k
• Rooted directed path graphs are leaf powers
• Some remarks about leaf roots
• Structure and linear time recognition of 3-leaf powers
• Structure and linear-time recognition of 4-leaf powers
• The 3-Steiner Root Problem
• The 4-Steiner Root problem
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Threshold tolerance graphs
• Tolerance graphs
• Towards a characterization of leaf powers by clique arrangements

This page was built for publication: Lower bounds for leaf rank of leaf powers

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