5 search results - page 1 / 1 » Cycle length parities and the chromatic number |
108
Voted
JGT
2010
14 years 8 months ago
2010
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
92
Voted
ENDM
2008
14 years 10 months ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
72
Voted
JGT
2010
14 years 8 months ago
2010
: Let G be a toroidal graph without cycles of a fixed length k, and l(G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant...
84
Voted
GC
2010
Springer
14 years 8 months ago
2010
Springer
A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
DM
2008
14 years 10 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...