A polynomial bound on the number of minimal separators and potential maximal cliques in -free graphs of bounded clique number
arXiv:2310.11573 · doi:10.46298/dmtcs.12438
Abstract
In this note we show a polynomial bound on the number of minimal separators and potential maximal cliques in -free graphs of bounded clique number.