List colouring triangle free planar graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2019
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916143940239360 |
|---|---|
| author | Hu, Jianzhang Zhu, Xuding |
| author_facet | Hu, Jianzhang Zhu, Xuding |
| contents | This paper proves the following result: Assume $G$ is a triangle free planar graph, $X$ is an independent set of $G$. If $L$ is a list assignment of $G$ such that $\mid L(v)\mid = 4$ for each vertex $v \in V(G)-X$ and $\mid L(v)\mid = 3$ for each vertex $v \in X$, then $G$ is $L$-colourable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1910_12480 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | List colouring triangle free planar graphs Hu, Jianzhang Zhu, Xuding Combinatorics This paper proves the following result: Assume $G$ is a triangle free planar graph, $X$ is an independent set of $G$. If $L$ is a list assignment of $G$ such that $\mid L(v)\mid = 4$ for each vertex $v \in V(G)-X$ and $\mid L(v)\mid = 3$ for each vertex $v \in X$, then $G$ is $L$-colourable. |
| title | List colouring triangle free planar graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/1910.12480 |