k disjoint cycles containing specified independent vertices
Discrete Mathematics(2008)
摘要
Let k⩾1 be an integer and G be a graph of order n⩾3k satisfying the condition that σ2(G)⩾n+k-1. Let v1,…,vk be k independent vertices of G, and suppose that G has k vertex-disjoint triangles C1,…,Ck with vi∈V(Ci) for all 1⩽i⩽k.
更多查看译文
关键词
Degree sum condition,Independent vertices,Vertex-disjoint cycles
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络