Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles |
| |
| Authors: | Rui Li Baogang Xu |
| |
| Affiliation: | aSchool of Mathematical Sciences, Nanjing Normal University, 1 Wenyuan Road, Yadong New District, Nanjing, 210046, China;bNormal College, Shihezi University, Shihezi, Xinjiang, 832003, China |
| |
| Abstract: | Two cycles are said to be adjacent if they share a common edge. Let G be a planar graph without triangles adjacent 4-cycles. We prove that  if Δ(G)≥6, and  and  if Δ(G)≥8, where  and  denote the list edge chromatic number and list total chromatic number of G, respectively. |
| |
| Keywords: | List total coloring List edge coloring Planar graphs |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
