• Title of article

    Planar graphs without 5-cycles or without 6-cycles

  • Author/Authors

    Ma، نويسنده , , Qin and Wu، نويسنده , , Jian-Liang and Yu، نويسنده , , Xiao، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2009
  • Pages
    8
  • From page
    2998
  • To page
    3005
  • Abstract
    Let G be a planar graph without 5-cycles or without 6-cycles. In this paper, we prove that if G is connected and δ ( G ) ≥ 2 , then there exists an edge x y ∈ E ( G ) such that d ( x ) + d ( y ) ≤ 9 , or there is a 2-alternating cycle. By using the above result, we obtain that (1) its linear 2-arboricity l a 2 ( G ) ≤ ⌈ Δ ( G ) + 1 2 ⌉ + 6 , (2) its list total chromatic number is Δ ( G ) + 1 if Δ ( G ) ≥ 8 , and (3) its list edge chromatic number is Δ ( G ) if Δ ( G ) ≥ 8 .
  • Keywords
    List edge coloring , Planar graph , List total coloring , Linear 2-arboricity , cycle
  • Journal title
    Discrete Mathematics
  • Serial Year
    2009
  • Journal title
    Discrete Mathematics
  • Record number

    1598789