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…

Papers overview

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

2018

Given an edge‐colored graph G, a cycle with all its edges with different colors is called a rainbow cycle. The rainbow cycle…

2016

In an edge-colored graph, a traversal cost occurs at a vertex along a path when consecutive edges with different colors are…

2015

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…

2011

2009

The purpose of this paper is to study the deterministic isolation for certain structures in directed and undirected planar graphs…

2009

The Vehicle Routing Problem (VRP) is a generalization of the Traveling Salesman Problem (TSP) and is also one of the most…

2006

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

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

We study the relationship between failure localization and the properties of link restoration algorithms, employing a…

1992