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

SOME RESULTS ON CIRCULAR PERFECT GRAPHS AND PERFECT GRAPHS
作者姓名:XUBaogang
作者单位:SchoolofMathematicsandComputerScience,NanjingNormalUniversity,Nanjing210097China
基金项目:This research is supported partially by National Natural Science Funds of China(10001035 and 10371055).
摘    要:An r-circular coloring of a graph G is a map f from V(G) to the set of open unit intervals of an Euclidean circle of length r, such that f(u) ∩ f(v) = Ф whenever uv ∈ E(G). Circular perfect graphs are defined analogously to perfect graphs by means of two parameters, the circular chromatic number and the circular clique number. In this paper, we study the properties of circular perfect graphs. We give (1) a necessary condition for a graph to be circular perfect, (2) some circular critical imperfect graphs, and (3) a characterization of graphs with the property that each of their induced subgraphs has circular clique number the same as its clique number, and then the two conjectures that are equivalent to the perfect graph conjecture.

关 键 词:图论  圆环  推理方法  顶点

SOME RESULTS ON CIRCULAR PERFECT GRAPHS AND PERFECT GRAPHS
XUBaogang.SOME RESULTS ON CIRCULAR PERFECT GRAPHS AND PERFECT GRAPHS[J].Journal of Systems Science and Complexity,2005,18(2):167-173.
Authors:XU Baogang
Abstract:
Keywords:Circular perfect  perfect  graph  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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