Skip to search formSkip to main contentSkip to account menu

Vertex cycle cover

Known as: Cycle cover, Edge disjoint cycle cover, Vertex disjoint cycle cover 
In mathematics, a vertex cycle cover (commonly called simply cycle cover) of a graph G is a set of cycles which are subgraphs of G and contain all… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
APXAdjacency matrixComplexity classCycle (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A note on the rainbow cycle cover problem
Given an edge‐colored graph G, a cycle with all its edges with different colors is called a rainbow cycle. The rainbow cycle… 
2016
2016
Edge Coloring with Minimum Reload/Changeover Costs
In an edge-colored graph, a traversal cost occurs at a vertex along a path when consecutive edges with different colors are… 
2011
2011
Effectiveness of mustard short-cycle cover crops for management of Phytophthora capsici and Fusarium spp. in cucurbits
2009
2009
On the Power of Isolation in Planar Structures
  • R. Kulkarni
  • Electron. Colloquium Comput. Complex.
  • 2009
  • Corpus ID: 17120962
The purpose of this paper is to study the deterministic isolation for certain structures in directed and undirected planar graphs… 
2009
2009
APPROXIMATION ALGORITHMS FOR THE CAPACITATED VEHICLE ROUTING PROBLEM
The Vehicle Routing Problem (VRP) is a generalization of the Traveling Salesman Problem (TSP) and is also one of the most… 
2006
2006
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle… 
2005
2005
Spanning-tree based monitoring-cycle construction for fault detection and localization in mesh AONs
We previously showed the feasibility of a fault detection scheme for all-optical networks (AONs) based on decomposing networks… 
Highly Cited
2001
Highly Cited
2001
Towards a deeper understanding of link restoration algorithms for mesh networks
We study the relationship between failure localization and the properties of link restoration algorithms, employing a… 
2001
2001
The Bounded Cycle-Cover Problem
We consider the bounded cycle-cover problem, which is to find a minimum cost cycle cover of a two-connected graph such that no… 
1992
1992
On cycle double covers of line graphs
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)