Covering the vertices of a graph with cycles of bounded length

Abstract

Let ck(G) be the minimum number of elementary cycles of length at most k necessary to cover the vertices of a given graph G. In this work, we bound ck(G) by a function of the order of G and its independence number. © 2008 Elsevier B.V. All rights reserved.

DOI: 10.1016/j.disc.2008.03.031

Extracted Key Phrases

Cite this paper

@article{Bekkai2009CoveringTV, title={Covering the vertices of a graph with cycles of bounded length}, author={Siham Bekkai and David Forge and Mekkia Kouider}, journal={Discrete Mathematics}, year={2009}, volume={309}, pages={1963-1966} }