Work

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

Year: 2025

Type: article

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.

Source: Discrete Mathematics & Theoretical Computer Science

DOI: 10.46298/dmtcs.12438

Authors: Marcin Pilipczuk, Paweł Rzążewski

Institution: University of Warsaw

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: European Commission, H2020 European Research Council

Awards: G434337789, Decomposition methods for discrete problems

OpenAlex ID: W4408549798

FWCI:

Cites:

Cited by:

Related to: 10