A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913743102803968 |
|---|---|
| author | Pilipczuk, Marcin Rzążewski, Paweł |
| author_facet | Pilipczuk, Marcin Rzążewski, Paweł |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_11573 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number Pilipczuk, Marcin Rzążewski, Paweł Discrete Mathematics Combinatorics 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. |
| title | A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number |
| topic | Discrete Mathematics Combinatorics |
| url | https://arxiv.org/abs/2310.11573 |