Sciweavers

EJC
2010

Counting paths in digraphs

13 years 11 months ago
Counting paths in digraphs
Say a digraph is k-free if it has no directed cycles of length at most k, for k Z+ . Thomass
Paul D. Seymour, Blair Sullivan
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2010
Where EJC
Authors Paul D. Seymour, Blair Sullivan
Comments (0)