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
·
2023-10-18
·
via math.CO updates on arXiv.org
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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。