Neighborhoods and Covering Vertices by Cycles

详细信息    查看全文

• 作者：Mekkia Kouider
• 关键词：AMS Subject Classification (1991) Classes ;   ; 05C38 ; 05C70 ; 05C35
• 刊名：Combinatorica
• 出版年：2000
• 出版时间：February 2000
• 年：2000
• 卷：20
• 期：2
• 页码：219-226
• 全文大小：171 KB
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics
  Combinatorics
  Mathematics
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1439-6912

文摘

=(V,E) is a 2-connected graph, and X is a set of vertices of G such that for every pair x,x' in X, , and the minimum degree of the induced graph <X> is at least 3, then X is covered by one cycle. This result will be in fact generalised by considering tuples instead of pairs of vertices.