논문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)
- J. A. Bondy, "Graph Theory with Applications" (1976), North-Holland
- O. Borodin, "List edge and list total colourings of multi- graphs", J. Combin. Theory Ser. B, 71, pp.184~204 (1997)
- J. Cai, "Edge-choosability of planar graphs without non- induced 5-cycles", Inform. Process. Lett, 109(7), pp.343~346 (2009)
- F. Galvin, "The list chromatic index of a bipartite multigraph", J. Combin. Theory Ser. B, 63(1), pp.153~158 (1995)
- R. Haggkvist, "Some upper bounds on the total and list chromatic numbers of multigraphs", J. Graph Theory, 16(5), pp.503~516 (1992)
- 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)
- J. Hou, "Edge-choosability of planar graphs without adjacent triangles or without 7-cycle", Discrete Math, 309(1), pp.77~84 (2009)
- J. Hou, "List edge and list total colorings of planar graphs without 4-cycles", Theoret. Comput. Sci, 369(1), pp.250~255 (2006)
- J. Hou, "List edge and list total colorings of planar graphs without short cycles", Inform. Process. Lett, 108(6), pp.347~351 (2008)
- J. Hou, "Some results on list total colorings of planar graphs", Lecture Note in Computer Science, 4489, pp.320~328 (2007)
- T. Jensen, "Graph Coloring Problem" (1995), Wiley-Interscience
- A. Kostochka, "List edge chromatic number of graphs with large girth", Discrete Math, 101(1), pp.189~201 (1992)
- W.Wang, "Choosability, edge-choosability and total choosability of outerplane graphs", European J. Combin, 22(1), pp.71~78 (2001)
- W.Wang, "Choosability and edge choosability of planar graphs without five cycles", Appl. Math. Lett, 15(5), pp.561~565 (2002)
- W.Wang, "Structural properties and edge choosability of planar graphs without 6-cycles", Combin. Probab. Comput, 10(3), pp.267~276 (2001)
- L. Zhang, "Edge choosability of planar graphs without small cycles", Discrete Math, 283(1), pp.289~293 (2004)
관련 논문AI추천
Total colorings of planar graphs with maximum degree at least 7 and without adjacent 5-cyclesXiang Tan대한수학회 · 대한수학회보2016 · 제53권 제1호A sufficient condition for acyclic 5-choosability of planar graphs without 5-cyclesLin Sun대한수학회 · 대한수학회보2018 · 제55권 제2호List injective coloring of planar graphs with girth at least fiveHong-Yu Chen대한수학회 · 대한수학회보2024 · 제61권 제1호On the conjecture of planar graphsAbdollahzadeh Ahangar, Pushpalatha장전수학회 · Advanced Studies in Contemporary Mathematics2010 · 제20권 제1호THE LINEAR 2-ARBORICITY OF PLANAR GRAPHS WITHOUT ADJACENT SHORT CYCLESHong-Yu Chen, Jian-Liang Wu, Xiang Tan대한수학회 · 대한수학회보2012 · 제49권 제1호On uniquely 3-list colorable graphsH. Abdollahzadeh Ahangar, L. Pushpalatha, S.M. Sheikholeslami, Yancai Zhao장전수학회 · Advanced Studies in Contemporary Mathematics2012 · 제22권 제4호
이 간행물의 다른 논문 (20건)
GEOMETRIC QUANTIZATION OF ODD DIMENSIONAL SPINc MANIFOLDSJian Wang, Yong Wangpp. 223-234FUNCTION ALGEBRAS ON BIDISKSKieu Phuong Chi, Nguyen Quang Dieupp. 235-247SENSITIVITY ANALYSIS FOR A CLASS OF IMPLICIT MULTIFUNCTIONS WITH APPLICATIONSMinghua Li, Shengjie Lipp. 249-262SHADOWABLE CHAIN TRANSITIVE SETS OF C1-GENERIC DIFFEOMORPHISMSXiao Wen, 이건희pp. 263-270LINEAR WEINGARTEN SPACELIKE HYPERSURFACES IN LOCALLY SYMMETRIC LORENTZ SPACEDan Yangpp. 271-284
