-
Abstract: By applying discharging method and using the properties of critical graphs, we proved that every simple planar graph G with Delta =6 is of class 1, if any two k-cycles of length at most 6 are not adjacent.
-
Key words:
- planar graphedge coloringmaximum degreecycle /
点击查看大图
计量
- 文章访问数: 2657
- HTML全文浏览量: 4
- PDF下载量: 1052
- 被引次数: 0