Minimal separators in graph classes defined by small forbidden induced subgraphs

Martin Milanič, Nevena Pivač

Minimal separators in graphs are an important concept in algorithmic graph theory. In particular, many problems that are NP-hard for general graphs are known to become polynomial-t…