66 search results - page 1 / 14 » Cycles in dense digraphs |
COMBINATORICA
2008
15 years 19 days ago
2008
92
Voted
EJC
2006
15 years 16 days ago
2006
The digraphs P(n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k + 1) permutations. Answering a question of Starling, Klerlein, K...
SIAMDM
2008
15 years 13 days ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
63
Voted
EJC
2010
15 years 18 days ago
2010
Say a digraph is k-free if it has no directed cycles of length at most k, for k Z+ . Thomass
109
Voted
ISAAC
1994
Springer
15 years 4 months ago
1994
Springer
We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an n-vertex planar digraph G with real