On Graphs Whose Maximal Cliques and Stable Sets Intersect
On Graphs Whose Maximal Cliques and Stable Sets Intersect
复制标题
关于最大团与稳定集相交的图
DOI:
--
复制
发表时间:
2018
期刊:
影响因子:
--
通讯作者:
V. Gurvich
中科院分区:
文献类型:
--
作者:
D. Andrade;E. Boros;V. Gurvich
We say that a graph G has the CIS-property and call it a CIS-graph if every maximal clique and every maximal stable set of G intersects.