Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4649344 | Discrete Mathematics | 2009 | 13 Pages |
Abstract
In this paper, we proved the following result: Let GG be a (k+2)(k+2)-connected, non-(k−3)(k−3)-apex graph where k≥2k≥2. If GG contains three kk-cliques, say L1L1, L2L2, L3L3, such that |Li∩Lj|≤k−2(1≤i
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jianbing Niu, Cun-Quan Zhang,