15 search results - page 1 / 3 » Cycles with consecutive odd lengths |
GC
2002
Springer
13 years 4 months ago
2002
Springer
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even...
GC
2010
Springer
13 years 1 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel grap...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We study the cycles generated by the chip firing game associated with n-cube orientations. We show the existence of the cycles generated by parallel evolutions of even lengths fro...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)â...