A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Marcin Pilipczuk, Paweł Rzążewski

Journal title: Discrete Mathematics & Theoretical Computer Science

Journal number: vol. 27:2

Journal publisher: Maison de l'informatique et des mathematiques discretes

Published year: 2025

DOI identifier: 10.46298/dmtcs.12438

ISSN: 1365-8050