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


An unavoidable set of configurations in planar triangulations
Authors:K Appel  W Haken
Institution:Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801 USA
Abstract:Let T be a normal triangulation (considered in the context of the four-color problem). Assume that no two vertices of degree 5 are adjacent. Then T contains at least 1 of the 47 configurations in Table I all of which are likely to be 4-color reducible.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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