General Result;
Equivalent Problem;
Face Size;
Maximum Face;
Color Theorem;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
The problems of cyclic colorings (due to Ore and Plummer) and diagonal colorings (due to Bouchet, Fouquet, Jolivet, and Riviere) were simultaneously generalized by Hornak and Jendrol into d-diagonal colorings. A coloring of a graph embedded on a surface is d-diagonal if any pair of vertices which are in the same face after the deletion of at most d edges of the graph are colored differently. A cyclic coloring is a 0-diagonal coloring, and a diagonal coloring is a 1-diagonal coloring.