120 search results - page 3 / 24 » Cycle lengths in sparse graphs |
JCT
2010
15 years 2 months ago
2010
139
click to vote
GC
2008
Springer
15 years 3 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...
130
click to vote
JGT
2010
14 years 10 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 ...