Geodesic
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
Discussiones Mathematicae. Graph Theory, Tome 29 (2009) no. 1, pp. 163-178

Voir la notice de l'article provenant de la source Library of Science

Let G be a planar graph with no two 3-cycles sharing an edge. We show that if Δ(G) ≥ 9, then χ'ₗ(G) = Δ(G) and χ”ₗ(G) = Δ(G)+1. We also show that if Δ(G) ≥ 6, then χ'ₗ(G) ≤ Δ(G)+1 and if Δ(G) ≥ 7, then χ”ₗ(G) ≤ Δ(G)+2. All of these results extend to graphs in the projective plane and when Δ(G) ≥ 7 the results also extend to graphs in the torus and Klein bottle. This second edge-choosability result improves on work of Wang and Lih and of Zhang and Wu. All of our results use the discharging method to prove structural lemmas about the existence of subgraphs with small degree-sum. For example, we prove that if G is a planar graph with no two 3-cycles sharing an edge and with Δ(G) ≥ 7, then G has an edge uv with d(u) ≤ 4 and d(u)+d(v) ≤ Δ(G)+2. All of our proofs yield linear-time algorithms that produce the desired colorings.
Keywords: list coloring, edge coloring, total coloring, Vizing's Conjecture 
@article{DMGT_2009_29_1_a9,
     author = {Cranston, Daniel},
     title = {Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {163--178},
     publisher = {mathdoc},
     volume = {29},
     number = {1},
     year = {2009},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2009_29_1_a9/}
}
TY  - JOUR
AU  - Cranston, Daniel
TI  - Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2009
SP  - 163
EP  - 178
VL  - 29
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2009_29_1_a9/
LA  - en
ID  - DMGT_2009_29_1_a9
ER  - 
%0 Journal Article
%A Cranston, Daniel
%T Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
%J Discussiones Mathematicae. Graph Theory
%D 2009
%P 163-178
%V 29
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2009_29_1_a9/
%G en
%F DMGT_2009_29_1_a9
Cranston, Daniel. Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles. Discussiones Mathematicae. Graph Theory, Tome 29 (2009) no. 1, pp. 163-178. http://geodesic.mathdoc.fr/item/DMGT_2009_29_1_a9/