首页 | 本学科首页   官方微博 | 高级检索  
     


Coloring even-faced graphs in the torus and the Klein bottle
Authors:Daniel Král’  Robin Thomas
Affiliation:(1) Institute for Theoretical Computer Science (ITI) Faculty of Mathematics and Physics, Charles University, Malostranské náměstí 25, 118 00 Prague, Czech Republic;(2) School of Mathematics, Georgia Institute of Technology, 686 Cherry St., Atlanta, GA 30332, USA
Abstract:
We prove that a triangle-free graph drawn in the torus with all faces bounded by even walks is 3-colorable if and only if it has no subgraph isomorphic to the Cayley graph C(Z 13; 1,5). We also prove that a non-bipartite quadrangulation of the Klein bottle is 3-colorable if and only if it has no non-contractible separating cycle of length at most four and no odd walk homotopic to a non-contractible two-sided simple closed curve. These results settle a conjecture of Thomassen and two conjectures of Archdeacon, Hutchinson, Nakamoto, Negami and Ota. Institute for Theoretical Computer Science is supported as project 1M0545 by the Ministry of Education of the Czech Republic. The author was visiting Georgia Institute of Technology as a Fulbright scholar in the academic year 2005/06. Partially supported by NSF Grants No. DMS-0200595 and DMS-0354742.
Keywords:Mathematics Subject Classification (2000) 05C15  05C10
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号