Acyclic colorings of planar graphs
Acyclic colorings of planar graphs
复制标题
DOI：
10.1007/bf02764716
复制
发表时间：
1973-12
影响因子：
1
通讯作者：
B. Grünbaum
中科院分区：
文献类型：
--
作者：
B. Grünbaum
如果没有圈是双色的，则用kcolors对图的顶点进行染色称为无圈的。证明了平面图都有九种颜色的非圈染色，并猜想五种颜色是充分的。其他相关类型的着色的结果也得到了，其中一些推广已知的事实“点荫”。
A coloring of the vertices of a graph bykcolors is called acyclic provided that no circuit is bichromatic. We prove that every planar graph has an acyclic coloring with nine colors, and conjecture that five colors are sufficient. Other results on related types of colorings are also obtained; some of them generalize known facts about “point-arboricity”.