Graph classes with few minimal separators. II: A dichotomy

DOI10.1137/1.9781611977554.CH120MaRDI QIDQ6538650zbMATH OpenFDO

Authors Peter Gartland, Daniel Lokshtanov

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH120

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• Taming graphs with no large creatures and skinny ladders
• Comparison of k-creature and t-critter
• A polynomial bound on the number of minimal separators and potential maximal cliques in P₆-free graphs of bounded clique number
• Exploring the closure operator for minimal a, b-separators: insights from Galois connections

This page was built for publication: Graph classes with few minimal separators. II: A dichotomy

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