Some Results on List Total Colorings of Planar Graphs

Authors:
Jianfeng Hou;Guizhen Liu;Jianliang Wu
Affiliations:
Department of Mathematics, Shandong University, Jinan, Shandong, P.R. China;Department of Mathematics, Shandong University, Jinan, Shandong, P.R. China;Department of Mathematics, Shandong University, Jinan, Shandong, P.R. China
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Year:
2007

Citing 8
Cited 3

The list chromatic index of a bipartite multigraph

Journal of Combinatorial Theory Series B
List edge and list total colourings of multigraphs

Journal of Combinatorial Theory Series B
Edge-choosability of multicircuits

Discrete Mathematics
Choosability, edge choosability, and total choosability of outerplane graphs

European Journal of Combinatorics
List Total Colourings of Graphs

Combinatorics, Probability and Computing
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs

Combinatorics, Probability and Computing
Graph Theory With Applications

Graph Theory With Applications
On total 9-coloring planar graphs of maximum degree seven

Journal of Graph Theory

On the total choosability of planar graphs and of sparse graphs

Information Processing Letters
Note: Total choosability of planar graphs with maximum degree 4

Discrete Applied Mathematics
(Δ+1)-total-colorability of plane graphs of maximum degree Δ≥6 with neither chordal 5-cycle nor chordal 6-cycle

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G be a planar graph with maximum degree Δ. In this paper, it is proved that if Δ 驴 9, then G is total-(Δ + 2)-choosable. Some results on list total coloring of G without cycles of specific lengths are given.