On strongly chordal graphs that are not leaf powers

DOI10.1007/978-3-319-68705-6_29zbMath1483.05186arXiv1703.08018OpenAlexW2601448663MaRDI QIDQ1687937

Manuel Lafond

Publication date: 4 January 2018

Full work available at URL: https://arxiv.org/abs/1703.08018

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Recognition of linear and star variants of leaf powers is in P ⋮ Recognizing k -Leaf Powers in Polynomial Time, for Constant k ⋮ Mim-width. III. Graph powers and generalized distance domination problems

This page was built for publication: On strongly chordal graphs that are not leaf powers