120 search results - page 3 / 24 » Cycle lengths in sparse graphs |
CPC
2000
14 years 9 months ago
2000
A recently posed question of H
JCT
2010
14 years 8 months ago
2010
89
Voted
GC
2008
Springer
14 years 9 months ago
2008
Springer
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
JGT
2010
14 years 4 months ago
2010
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
87
Voted
SIROCCO
2004
14 years 11 months ago
2004