Skip to search formSkip to main contentSkip to account menu

Edge cycle cover

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

Related topics

Related topics

6 relations
Bridge (graph theory)Cycle (graph theory)Graph (discrete mathematics)Planar graph

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Integer 4-Flows and Cycle Covers
  • G. Fan
  • Comb.
  • 2017
  • Corpus ID: 46862889
Let G be a bridgeless graph and denote by cc(G) the shortest length of a cycle cover of G. Let V2(G) be the set of vertices of… 
Review
2010
Review
2010
The Asymmetric Traveling Salesman Problem
  • 2010
  • Corpus ID: 16917428
This thesis is a survey on the approximability of the asymmetric traveling salesmanproblem with triangle inequality (ATSP).In the… 
2006
2006
Minimum-weight cycle covers and their approximability
2005
2005
On Approximating Restricted Cycle Covers
  • B. Manthey
  • SIAM journal on computing (Print)
  • 2005
  • Corpus ID: 3948573
Compounds of formula (1) (1) wherein A and B are identical or different alkyl, aralkyl or cycloalkyl groups or carbocyclic or… 
2004
2004
Monitoring cycles for fault detection in meshed all-optical networks
Fault detection is critical for all-optical networks (AONs). This paper introduces the concept of monitoring cycle and proposes a… 
2002
2002
Understanding p-Cycles, Enhanced Rings, and Oriented Cycle Covers
A system for protecting an electrical resistor, such as, for example, the dynamic braking resistor of a D.C. traction motor used… 
Highly Cited
2001
Highly Cited
2001
z-Approximations
Approximation algorithms for NP-hard optimization problems have been widely studied for over three decades. Most of these measure… 
1992
1992
Short cycle covers and the cycle double cover conjecture
  • Ury JamshyM. Tarsi
  • Journal of combinatorial theory. Series B (Print)
  • 1992
  • Corpus ID: 28192266
1992
1992
Integer flows and cycle covers
  • G. Fan
  • Journal of combinatorial theory. Series B (Print)
  • 1992
  • Corpus ID: 8586526
Highly Cited
1989
Highly Cited
1989
Double cycle covers and the petersen graph
Let O(G) denote the set of odd-degree vertices of a graph G. Let t ϵ N and let t denote the family of graphs G whose edge set has… 
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)