|
OALib Journal期刊
ISSN: 2333-9721
费用：99美元
|
|
|
|
不含2K1+K2和C4作为导出子图的图的色数
, PP. 9-12
Keywords: 色数,团数,F-free图
Abstract:
设图G不含与2K1+K2同构的导出子图,并且不含导出4-圈,通过对该图类独立数的讨论,刻画出它的结构,从而得到该图类色数与团数有关的线性的上界.
| [1] | BLAZSIK Z, HUJTER M, PLUHAR A, et al. Graphs with no induce C4 and 2K2 [J]. Discrete Math, 1993, 115: 51-55.
|
| [2] | LI R. Hamiltonicity of 2-connected {K1,4, K1,4+e}-free graphs[J]. Discrete Math, 2004, 287: 69-76.
|
| [3] | DUAN F, WANG G P. Note on the longest paths in {K1,4, K1,4+e}-free graphs[J]. Acta Math Sinica, 2012, 28: 2501-2506.
|
| [4] | TIAN R L, XIONG L M. On hamiltonicity of 2-connected claw-free graphs[J]. Appl Math J Chinese Univ, 2012, 27(2): 234-242.
|
| [5] | HOANG C T, MCDIARMID C. On the divisibility of graphs[J]. Discrete Math, 2002, 242: 145-156.
|
| [6] | DUAN F, WU B Y. On chromatic number of graphs without certain induced subgraphs[J]. Ars combinatoria, 2011(7): 33-44.
|
Full-Text
|
|
Contact Us
service@oalib.com QQ:3279437679 
WhatsApp +8615387084133
|
|
