A Note on (3,1)-Choosable Toroidal Graphs
| dc.creator | Xu, Baogang | |
| dc.creator | Yu, Qinglin | |
| dc.date | 2006-09-27 | |
| dc.date.accessioned | 2026-07-07T07:25:18Z | |
| dc.date.available | 2026-07-07T07:25:18Z | |
| dc.description | An $(L,d)^*$-coloring is a mapping $ϕ$ that assigns a color $ϕ(v)\in L(v)$ to each vertex $v\in V(G)$ such that at most $d$ neighbors of $v$ receive colore $ϕ(v)$. A graph is called $(m,d)^*$-choosable, if $G$ admits an $(L,d)^*$-coloring for every list assignment $L$ with $|L(v)|\geq m$ for all $v\in V(G)$. In this note, it is proved that every toroidal graph, which contains no adjacent triangles and contains no 6-cycles and $l$-cycles for some $l \in \{5,7\}$, is $(3,1)^*$-choosable. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/math/0609757 | |
| dc.identifier | http://arxiv.org/abs/math/0609757 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/116673 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C15, 05C78 | |
| dc.title | A Note on (3,1)-Choosable Toroidal Graphs | |
| dc.type | text |