On $(K_{q},k)$ Stable Graphs with Small $k$

Electronic Journal Of Combinatorics

Jean-Luc Fouquet¹ 

关键词: Graph theory;    Stable graphs;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A graph $G$ is $(K_{q},k)$ stable if it contains a copy of $K_{q}$ after deleting any subset of $k$ vertices. In a previous paper we have characterized the $(K_q,k)$ stable graphs with minimum size for $3 \le q \le 5$ and we have proved that the only $(K_

【 授权许可】

Others