120 search results - page 1 / 24 » Cycle lengths in sparse graphs |
COMBINATORICA
2008
13 years 10 months ago
2008
COMBINATORICS
2002
13 years 9 months ago
2002
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induc...
COMBINATORICS
2006
13 years 9 months ago
2006
We prove several results regarding edge-colored complete graphs and rainbow cycles, cycles with no color appearing on more than one edge. We settle a question posed by Ball, Pultr...
GC
2010
Springer
13 years 7 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 ...
DM
2010
13 years 10 months ago
2010
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...