Covering the vertices of a graph with cycles of bounded length

DOI10.1016/j.disc.2008.03.031zbMath1205.05174OpenAlexW1989763469MaRDI QIDQ1025448

David L. Forge, Siham Bekkai, Mekkia Kouider

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.03.031

zbMATH Keywords

cycleindependence numbervertex covering

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coverings of the vertices of a graph by small cycles
• On the maximum number of independent cycles in a graph
• On the existence of disjoint cycles in a graph
• Cycles in graphs with prescribed stability number and connectivity
• Covering vertices of a graph by \(k\) disjoint cycles
• Covering cycles and \(k\)-term degree sums
• On the maximal number of independent circuits in a graph

This page was built for publication: Covering the vertices of a graph with cycles of bounded length