JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)

Previous Articles     Next Articles

Edge colorings of 1-planar graphs for maximum degree eight #br# without adjacent 4-cycles

ZHANG Jia-li, MIAO Lian-ying, SONG Wen-yao   

  1. College of Sciences, China University of Mining and Technology, Xuzhou 221008, Jiangsu, China
  • Received:2013-03-29 Online:2014-04-20 Published:2014-06-03

Abstract: It is proved that every 1-planar graph of maximum degree 9 without adjacent 4-cycles can be 9-edge-colorable by the discharging method.

Key words: edge coloring, discharging, 1-planar graph

[1] WANG Xiao-li, WANG Hui-juan, LIU Bin. Total coloring of planar graphs with maximum degree seven [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(8): 100-106.
[2] PAN Wen-hua, XU Chang-qing. Neighbor sum distinguishing index of a kind of sparse graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(8): 94-99.
[3] WANG Ye, SUN Lei. Every 1-planar graph without cycles of length 3 or 4 is 5-colorable [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(4): 34-39.
[4] MENG Xian-qing. Strong edge coloring of a class of planar graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2015, 50(08): 10-13.
[5] HE Xue, TIAN Shuang-liang. Adjacent vertex-distinguishing edge/total colorings of double graph of some graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2015, 50(04): 63-66.
[6] SUN Lin, CAI Hua. On the vertex-arboricity of embedded graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2015, 50(02): 38-42.
[7] MA Gang. Acyclic list edge coloring of planar graphs with girth #br# ≥ 11 and maximum degree 3 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2014, 49(2): 18-23.
[8] TIAN Shuang-liang. Vertex-distinguishing edge coloring of the generalized lexicographic product of some graphs#br# [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2014, 49(06): 31-34.
[9] CHEN Xiang-en1, WANG Zhi-wen2, ZHAO Fei-hu1, WEI Jia-jing1, YAO Bing1. General neighbor-distinguishing edge coloring of  strong products and compositions of graphs [J]. J4, 2013, 48(6): 18-22.
[10] TIAN Shuang-liang. Vertex-distinguishing edge colorings of the Mycielski′s graphs of  some lexicographic product graphs [J]. J4, 2012, 47(8): 7-10.
[11] WANG Yan-li, MIAO Lian-ying. The set edge chromatic number of a graph [J]. J4, 2012, 47(6): 67-70.
[12] DING Wei. Acyclic edge coloring of planar graphs without 4-Cycles [J]. J4, 2012, 47(6): 76-79.
[13] LIU Xin-sheng, WEI Zi-ying. An upper bound for the adjacent vertex-distinguishing star chromatic number of graphs [J]. J4, 2012, 47(2): 52-55.
[14] GAO Yu-ping1, WANG Zhi-wen2, CHEN Xiang-en1*, YAO Bing1. On the vertex-distinguishing proper edge-coloring of K3,3∨Kt [J]. J4, 2012, 47(2): 60-64.
[15] DENG Kai1, LIU Xin-sheng2, TIAN Shuang-liang1. Star edge coloring of tree [J]. J4, 2011, 46(8): 84-88.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!