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


Critical perfect graphs and perfect 3-chromatic graphs
Authors:Alan Tucker
Institution:Department of Applied Mathematics and Statistics, SUNY at Stony Brook, Stony Brook, New York 11794 USA
Abstract:This paper builds on results based on D. R. Fulkerson's antiblocking polyhedra approach to perfect graphs to obtain information about critical perfect graphs and related clique-generated graphs. Then we prove that Berge's Strong Perfect Graph Conjecture is valid for 3-chromatic graphs.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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