Coverings of the Vertices of a Graph by Small Cycles

详细信息    查看全文

• 作者：David Forge and Mekkia Kouider
• 关键词：Vertex covering ; Cycles ; Paths
• 刊名：Graphs and Combinatorics
• 出版年：2007
• 出版时间：April, 2007
• 年：2007
• 卷：23
• 期：2
• 页码：135-143
• 全文大小：90 KB

文摘

Given a graph G with n vertices, we call c_k(G) the minimum number of elementary cycles of length at most k necessary to cover the vertices of G. We bound c_k(G) from the minimum degree and the order of the graph.