# Edge cycle cover

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- SIAM J. Discrete Math.
- 2016

We show that every bridgeless cubic graph $G$ with $m$ edges has a cycle cover of length at most 1.6 m. Moreover, if $G$ does not… (More)

Is this relevant?

2015

2015

- IEEE Transactions on Computers
- 2015

As a fundamental optimization problem, the vehicle routing problem has wide application backgrounds and has been paid lots of… (More)

Is this relevant?

2012

2012

- Journal of Graph Theory
- 2012

Let $G$ be a bridgeless cubic graph. Consider a list of $k$ 1-factors of $G$. Let $E_i$ be the set of edges contained in… (More)

Is this relevant?

2007

2007

- Theor. Comput. Sci.
- 2007

In this paper, we study the relationship between the Asymmetric Traveling Salesman Problem (ATSP) and the Cycle Cover Problem in… (More)

Is this relevant?

2005

2005

- WAOA
- 2005

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… (More)

Is this relevant?

2002

2002

- 2002

We investigate the effectiveness of link-protection schemes in terms of their
ability to handle node failures in all-optical… (More)

Is this relevant?

1997

1997

- Graphs and Combinatorics
- 1997

A graph with n vertices is said to have a small cycle cover provided its edges can be covered with at most (2n − 1)/3 cycles… (More)

Is this relevant?

1993

1993

- Discrete Mathematics
- 1993

Let G be a bridgeless graph. We show that the length of a shortest postman tour is at most |E(G)| + |V(G)| ? 3 and that, if G is… (More)

Is this relevant?

1992

1992

- J. Comb. Theory, Ser. B
- 1992

Abstract Results related to integer flows and cycle covers are presented. A cycle cover of a graph G is a collection C of cycles… (More)

Is this relevant?

1989

1989

- Journal of Graph Theory
- 1989

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… (More)

Is this relevant?