Nothing Special   »   [go: up one dir, main page]
Aijun Dong ; Guizhen Liu ; Guojun Li - List edge and list total colorings of planar graphs without non-induced 7-cyclesdmtcs:629 - Discrete Mathematics & Theoretical Computer Science, March 13, 2013, Vol. 15 no. 1 - https://doi.org/10.46298/dmtcs.629
List edge and list total colorings of planar graphs without non-induced 7-cyclesArticle

Authors: Aijun Dong 1; Guizhen Liu 2; Guojun Li 2

  • 1 School of science [Shandong]
  • 2 School of Mathematics [Shandong]

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.

https://doi.org/10.46298/dmtcs.629
Source: HAL:hal-00990609v1
Volume: Vol. 15 no. 1
Section: Graph and Algorithms
Published on: March 13, 2013
Accepted on: June 9, 2015
Submitted on: November 22, 2010
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Share and export

Consultation statistics

This page has been seen 473 times.
This article's PDF has been downloaded 568 times.