Computing Optimal Leaf Roots of Chordal Cographs in Linear Time

DOI10.1007/978-3-031-43587-4_25MaRDI QIDQ6448091zbMATH OpenOpenAlexFDO

Authors Van Bang Le, Christian Rosenke

Publication date 21 August 2023

Full work available at URL https://doi.org/10.1007/978-3-031-43587-4_25

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(3)

• Computing optimal leaf roots of chordal cographs in linear time
• Lower bounds for leaf rank of leaf powers
• k-leaf powers cannot be characterized by a finite set of forbidden induced subgraphs for k 5

This page was built for publication: Computing Optimal Leaf Roots of Chordal Cographs in Linear Time

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