On chromatic number of { 2K1+K2 , C4 }-free graphs
-
摘要: 设图 G 不含与 2K1+K2同构的导出子图, 并且不含导出4-圈, 通过对该图类独立数的讨论, 刻画出它的结构, 从而得到该图类色数与团数有关的线性的上界.Abstract: In this paper, the structural characterization of { 2K1+K2,C4 }-free graphs was given according to their independence numbers, and the linear upper bound on chromatic number of { 2K1+K2,C4 }-free graphs was obtained in terms of their clique number.
-
Key words:
- chromatic number /
- clique number /
- F-free graph
-
[1] {1} BLAZSIK Z, HUJTER M, PLUHAR A, et al. Graphs with no induce C4 and 2K2 [J]. Discrete Math, 1993, 115: 51-55.
点击查看大图
计量
- 文章访问数: 1407
- HTML全文浏览量: 24
- PDF下载量: 1903
- 被引次数: 0