Quadrangular embeddings of complete graphs and the Even Map Color Theorem
Quadrangular embeddings of complete graphs and the Even Map Color Theorem
复制标题
完全图的四边形嵌入和偶图颜色定理
DOI:
10.1016/j.jctb.2019.02.006
复制
发表时间:
2016
期刊:
影响因子:
--
通讯作者:
X. Zha
中科院分区:
文献类型:
--
作者:
Wenzhong Liu;S. Lawrencenko;Beifang Chen;M. Ellingham;N. Hartsfield;Hui Yang;D. Ye;X. Zha
Hartsfield and Ringel constructed orientable quadrangular embeddings of the complete graph K n for n≡ 5 (mod 8), and nonorientable ones for n≥ 9 and n≡ 1 (mod 4). These provide minimal quadrangulations of their underlying surfaces. We extend these results to determine, for every complete graph K n, n≥ 4, the minimum genus, both orientable and nonorientable, for the surface in which K n has an embedding with all faces of degree at least 4, and also for the surface in which K n has an embedding with all faces of even degree. These last embeddings provide sharpness examples for a result of Hutchinson bounding the chromatic number of graphs embedded with all faces of even degree, completing the proof of the Even Map Color Theorem. We also show that if a connected simple graph G has a perfect matching and a cycle then the lexicographic product G [K 4] has orientable and nonorientable quadrangular embeddings; this provides new examples of minimal quadrangulations.
DOI:
--
发表时间:
2004
期刊:
European J. Combin. 25
影响因子:
--
作者:
F.Hiai;X.Zhan;M.Aikawa;T.Kawai;A.Nakamoto
通讯作者:
A.Nakamoto