Covering a graph with cycles

DOI10.1002/jgt.3190200209zbMath0922.05043OpenAlexW2033014804MaRDI QIDQ4852405

Hong Wang

Publication date: 17 October 1999

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190200209

zbMATH Keywords

coveringindependent cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

A vertex cover with chorded 4-cycles ⋮ Covering vertices of a graph by \(k\) disjoint cycles ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Disjoint triangles and quadrilaterals in a graph ⋮ Covering a graph with cycles of length at least 4 ⋮ A degree condition of 2-factors in bipartite graphs ⋮ Cycle factors in dense graphs

This page was built for publication: Covering a graph with cycles