List edge and list total colorings of planar graphs without non-induced 7-cycles - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2013

List edge and list total colorings of planar graphs without non-induced 7-cycles

Abstract

Giving a planar graph G, let χ'l(G) and χ''l(G) denote the list edge chromatic number and list total chromatic number of G respectively. It is proved that if G is a planar graph without non-induced 7-cycles, then χ'l(G)≤Δ(G)+1 and χ''l(G)≤Δ(G)+2 where Δ(G)≥7.
Fichier principal
Vignette du fichier
1775-7769-1-PB.pdf (224.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990609 , version 1 (13-05-2014)

Identifiers

Cite

Aijun Dong, Guizhen Liu, Guojun Li. List edge and list total colorings of planar graphs without non-induced 7-cycles. Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 1 (1), pp.101--106. ⟨10.46298/dmtcs.629⟩. ⟨hal-00990609⟩

Collections

TDS-MACS
74 View
829 Download

Altmetric

Share

Gmail Facebook X LinkedIn More