A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
Marcin Pilipczuk, Paweł Rzążewski
Abstract
In this note we show a polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number.
Keywords
Computer Science - Discrete Mathematics
Mathematics - Combinatorics
Mathematics Subject Classification 2020
05C75 - Structural characterization of families of graphs
