中国综合性科技类核心期刊(北大核心)

中国科学引文数据库来源期刊(CSCD)

美国《化学文摘》(CA)收录

美国《数学评论》(MR)收录

俄罗斯《文摘杂志》收录

Message Board

Respected readers, authors and reviewers, you can add comments to this page on any questions about the contribution, review, editing and publication of this journal. We will give you an answer as soon as possible. Thank you for your support!

Name
E-mail
Phone
Title
Content
Verification Code
Issue 3
Jul.  2014
Turn off MathJax
Article Contents
SONG Wen-yao, MIAO Lian-ying, ZHANG Shu-jie. List edge and list total coloring of triangle-free 1-planar graphs[J]. Journal of East China Normal University (Natural Sciences), 2014, (3): 40-44.
Citation: SONG Wen-yao, MIAO Lian-ying, ZHANG Shu-jie. List edge and list total coloring of triangle-free 1-planar graphs[J]. Journal of East China Normal University (Natural Sciences), 2014, (3): 40-44.

List edge and list total coloring of triangle-free 1-planar graphs

  • Received Date: 2013-05-01
  • Rev Recd Date: 2013-08-01
  • Publish Date: 2014-05-25
  • A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it was proved that every triangle-free 1-planar graph $G$ with maximum degree $\Delta\geqslant15$ can be $\Delta$-edge-choosable and ($\Delta$+1)-total -choosable.
  • loading
  • {[1]} BONDY J A, MURTY  U S R. Graph Theory with Applications[M]. New York: North-Holland, 1976.
    {[2]} JENSEN T R,  TOFT B. Graph Coloring Problems [M]. NewYork: Wiley-Interscience, 1995.
    {[3]} HAGGKVIST R,  CHETWYND A. Some upper bounds on the total and list chromatic numbers of multigraphs[J]. Graph Theory, 1992, 16: 503-516.
    {[4]} BORODIN O V, KOSTOCHKA A V, WOODALL D R. List edge and list total colorings of multigraphs[J]. Journal of Combinatorial Theory Series B, 1997, 71: 184-204.
    {[5]} PERTERSON D, WOODALL D R. Edge-choosability in line-perfect multigraphs[J]. Discrete Mathematics, 1999, 202: 191-199.
    {[6]} HAGGKVIST R,  JANSSEN J. Now bounds on the list-chromatic index of the complete graph and other simple graphs[J]. Combinatorics, Probability and Computing, 1997, 6: 295-313.
    {[7]}GALVIN F. The list chromatic index of a bipartite multigraph[J]. Journal of Combinatorial Theory, Series B, 1995, 63: 153-158.
    {[8]} WOODALL D R. Edge-choosability of multicircuits[J]. Discrete Mathematics, 1999, 202: 271-277.
    {[9]} WAANG W, LIH K. Choosability, edge-choosability and total choosability of outerplane graphs[J].European Journal of Combinatorics, 2001, 22: 71-78.
    {[10]} HOU J, LIU G, CAI J. List edge and list total colorings of planar graphs without 4-cycles[J]. Theoretical Computer Science, 2006, 369: 250-255.
    {[11]} ZHANG X, WU J L, LIU G. List edge and list total coloring of 1-planar graphs[J]. Frontiers of Mathematics in China, 2012, 7(5): 1005-1018.
    {[12]} RINGEL G. Ein Sechsfarbenproblem auf der Kugel[J]. Abh Math Sem Univ, Hamburg, 1965, 29: 107-117.
    {[13]} ZHANG X, WU J L. On edge colorings of 1-planar graphs[J]. Information Processing Letters, 2011, 111(3): 124-128.
    {[14]} ZHANG X, LIU G,  WU J L. Edge coloring of trangle-free 1-planar graphs[J]. Joumal of Shandong University: Natural Science, 2010, 45: 15-17.
    {[15]} WU J L, WANG  P. List-edge and list-total colorings of graphs embedded on hyperbolic surfaces[J].  Discrete Mathematics, 2008, 308: 6210-6215.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Article views (1314) PDF downloads(1896) Cited by()
    Proportional views

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return