%A ZHANG Jia-li, MIAO Lian-ying, SONG Wen-yao %T Edge colorings of 1-planar graphs for maximum degree eight #br# without adjacent 4-cycles %0 Journal Article %D 2014 %J JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) %R 10.6040/j.issn.1671-9352.0.2013.138 %P 18-23 %V 49 %N 04 %U {http://lxbwk.njournal.sdu.edu.cn/CN/abstract/article_276.shtml} %8 2014-04-20 %X 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.