59 search results - page 3 / 12 » Odd Cycle Packing |
EUROPAR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We investigate the following very simple load-balancing algorithm on the N-cycle (N even) which we call Odd-Even Transposition Balancing (OETB). The edges of the cycle ar...
CORR
2004
Springer
13 years 5 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...
GC
2002
Springer
13 years 5 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...
JCO
2007
13 years 5 months ago
2007
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
DM
2010
13 years 5 months ago
2010
For a graph G let