-
摘要: 运用Discharge方法及临界图的一些重要性质证明了: 大度是5且任意一个3-圈与任意一个4-圈不相邻接, 或任意一个3-圈与任意一个5-圈不相邻接的可平面图是第一类图. 从而给出了最大度是5的可平面图是第一类图的2个充分条件.Abstract: By applying a discharging method and using some theorems of critical graphs, we proved that every planar graph G with Δ=5 is of class 1, if any 3-cycle is not adjacent to any 4-cycle or to any 5-cycle in G. Therefore, we concluded two sufficient conditions for planar graph G to be Class 1.
-
Key words:
- planar graphedge coloringmaximum degreecycle /
点击查看大图
计量
- 文章访问数: 2771
- HTML全文浏览量: 64
- PDF下载量: 1267
- 被引次数: 0