Processing math: 100%

Marcin Pilipczuk ; Paweł Rzążewski - A polynomial bound on the number of minimal separators and potential maximal cliques in P6-free graphs of bounded clique number

dmtcs:12438 - Discrete Mathematics & Theoretical Computer Science, March 18, 2025, vol. 27:2 - https://doi.org/10.46298/dmtcs.12438
A polynomial bound on the number of minimal separators and potential maximal cliques in P6-free graphs of bounded clique numberArticle

Authors: Marcin Pilipczuk ; Paweł Rzążewski

    In this note we show a polynomial bound on the number of minimal separators and potential maximal cliques in P6-free graphs of bounded clique number.

    https://doi.org/10.46298/dmtcs.12438
    Source: arXiv.org:2310.11573
    Volume: vol. 27:2
    Section: Graph Theory
    Published on: March 18, 2025
    Accepted on: March 12, 2025
    Submitted on: October 19, 2023
    Keywords: Computer Science - Discrete Mathematics,Mathematics - Combinatorics
    Licence: Attribution 4.0 International (CC BY 4.0)

    Share and export

    Consultation statistics

    This page has been seen 58 times.
    This article's PDF has been downloaded 21 times.