본문 바로가기
KERD
논문KCI 등재

LIST EDGE AND LIST TOTAL COLORINGS OF PLANAR GRAPHS WITHOUT 6-CYCLES WITH CHORD

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

Giving a planar graph G, let $x^'_l(G)$ and $x^{''}_l(G)$ denote the list edge chromatic number and list total chromatic number of G respectively. It is proved that if a planar graph G without 6-cycles with chord, then $x^'_l(G){\leq}{\Delta}(G)+1$ and $x^{''}_l(G){\leq}{\Delta}(G)+2$ where ${\Delta}(G){\geq}6$.

Abstract

Giving a planar graph G, let $x^'_l(G)$ and $x^{''}_l(G)$ denote the list edge chromatic number and list total chromatic number of G respectively. It is proved that if a planar graph G without 6-cycles with chord, then $x^'_l(G){\leq}{\Delta}(G)+1$ and $x^{''}_l(G){\leq}{\Delta}(G)+2$ where ${\Delta}(G){\geq}6$.

참고문헌 (16)

  1. J. A. Bondy, "Graph Theory with Applications" (1976), North-Holland
  2. O. Borodin, "List edge and list total colourings of multi- graphs", J. Combin. Theory Ser. B, 71, pp.184~204 (1997)
  3. J. Cai, "Edge-choosability of planar graphs without non- induced 5-cycles", Inform. Process. Lett, 109(7), pp.343~346 (2009)
  4. F. Galvin, "The list chromatic index of a bipartite multigraph", J. Combin. Theory Ser. B, 63(1), pp.153~158 (1995)
  5. R. Haggkvist, "Some upper bounds on the total and list chromatic numbers of multigraphs", J. Graph Theory, 16(5), pp.503~516 (1992)
  6. R. Haggkvist, "New bounds on the list-chromatic index of the complete graph and other simple graphs", Combin. Probab. Comput, 6(3), pp.295~313 (1997)
  7. J. Hou, "Edge-choosability of planar graphs without adjacent triangles or without 7-cycle", Discrete Math, 309(1), pp.77~84 (2009)
  8. J. Hou, "List edge and list total colorings of planar graphs without 4-cycles", Theoret. Comput. Sci, 369(1), pp.250~255 (2006)
  9. J. Hou, "List edge and list total colorings of planar graphs without short cycles", Inform. Process. Lett, 108(6), pp.347~351 (2008)
  10. J. Hou, "Some results on list total colorings of planar graphs", Lecture Note in Computer Science, 4489, pp.320~328 (2007)
  11. T. Jensen, "Graph Coloring Problem" (1995), Wiley-Interscience
  12. A. Kostochka, "List edge chromatic number of graphs with large girth", Discrete Math, 101(1), pp.189~201 (1992)
  13. W.Wang, "Choosability, edge-choosability and total choosability of outerplane graphs", European J. Combin, 22(1), pp.71~78 (2001)
  14. W.Wang, "Choosability and edge choosability of planar graphs without five cycles", Appl. Math. Lett, 15(5), pp.561~565 (2002)
  15. W.Wang, "Structural properties and edge choosability of planar graphs without 6-cycles", Combin. Probab. Comput, 10(3), pp.267~276 (2001)
  16. L. Zhang, "Edge choosability of planar graphs without small cycles", Discrete Math, 283(1), pp.289~293 (2004)

관련 논문AI추천

이 간행물의 다른 논문 (20건)