Covering a graph with cycles
From MaRDI portal
Recommendations
- Covering Graphs by Cycles
- scientific article; zbMATH DE number 4061294
- Covering a graph with cycles passing through given edges
- Covering a graph with cycles.
- Cycles in Graphs and Covers
- Covering the complete graph with plane cycles
- Cycle and cocycle coverings of graphs
- Covering the vertices of a graph with cycles of bounded length
- Covering the vertices of a graph by cycles of prescribed length
- scientific article; zbMATH DE number 169440
Cited in
(24)- Covering the vertices of a graph with cycles of bounded length
- Cycle factors in dense graphs
- Covering vertices of a graph by \(k\) disjoint cycles
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Covering a graph with cycles of length at least 4
- A vertex cover with chorded 4-cycles
- Stability for vertex cycle covers
- The covering chain of a graph
- scientific article; zbMATH DE number 4191728 (Why is no real title available?)
- scientific article; zbMATH DE number 5080500 (Why is no real title available?)
- Pentagons and cycle coverings
- Neighborhood unions and the cycle cover number of a graph
- Covering vertices by cycles
- Covering a graph with cycles passing through given edges
- Covering step graph
- Covering cycle matroid
- Cycles in Graphs and Covers
- Disjoint triangles and quadrilaterals in a graph
- Neighborhoods and covering vertices by cycles
- Computational complexity of covering cyclic graphs
- A degree condition of 2-factors in bipartite graphs
- Covering cycles in sparse graphs
- Covering the complete graph with plane cycles
- Coverings of the vertices of a graph by small cycles
This page was built for publication: Covering a graph with cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852405)
