Packing independent cliques into planar graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908519246069760 |
|---|---|
| author | Biró, Csaba Collado, Gabriel Zamora, Oscar |
| author_facet | Biró, Csaba Collado, Gabriel Zamora, Oscar |
| contents | The indeque number of a graph is largest set of vertices that induce an independent set of cliques. We study the extremal value of this parameter for the class and subclasses of planar graphs, most notably for forests and graphs of pathwidth at most $2$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_03298 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Packing independent cliques into planar graphs Biró, Csaba Collado, Gabriel Zamora, Oscar Combinatorics 05C10 The indeque number of a graph is largest set of vertices that induce an independent set of cliques. We study the extremal value of this parameter for the class and subclasses of planar graphs, most notably for forests and graphs of pathwidth at most $2$. |
| title | Packing independent cliques into planar graphs |
| topic | Combinatorics 05C10 |
| url | https://arxiv.org/abs/2408.03298 |