首页 | 本学科首页   官方微博 | 高级检索  
     


Coverings of the Vertices of a Graph by Small Cycles
Authors:David Forge  Mekkia Kouider
Affiliation:(1) LRI, UMR 8623, Université Paris-Sud, Bat 490, 91405 Orsay Cedex, France
Abstract:
Given a graph G with n vertices, we call ck(G) the minimum number of elementary cycles of length at most k necessary to cover the vertices of G. We bound ck(G) from the minimum degree and the order of the graph.
Keywords:Primary: 05C70  Secondary: 05C38
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号