摘要
N((3, 3), 5) denotes the minimum N so that there exists a graph of N vertices which doesn’t contain complete subgraph on 5 vertices and can’t be (3, 3)-colored. It is shown that N ((3, 3), 5) = l5.
N((3, 3), 5) denotes the minimum N so that there exists a graph of N vertices which doesn't contain complete subgraph on 5 vertices and can't be (3, 3)-colored. It is shown that N ((3, 3), 5) = l5.
出处
《大连理工大学学报》
EI
CAS
CSCD
北大核心
1992年第4期489-491,共3页
Journal of Dalian University of Technology
关键词
图色常量
着色
同构
coloring(mathematics)
isomorph
Ramsey theory/Ar-coloring
critical graph of HN5
