31

Voted
FOCS

2003

IEEE

14 years 2 months ago
2003

IEEE

A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...

WG

2007

Springer

14 years 3 months ago
2007

Springer

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 cover in which the length of every cycle is in the set ...