| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10332016 | Information Processing Letters | 2011 | 5 Pages |
Abstract
⺠In the study we investigate the edge coloring of 1-planar graphs. ⺠We describe an associated plane graph of 1-planar and use the discharging method in the detail proofs. ⺠It is proved that every 1-planar graphs with maximum degree at least 10 is of class 1 in terms of the edge coloring.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Xin Zhang, Jian-Liang Wu,