116 search results - page 3 / 24 » A Note on Cycle Lengths in Graphs |
154
click to vote
JGT
2010
15 years 1 months ago
2010
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
136
click to vote
ENDM
2008
15 years 3 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...
COMBINATORICA
2008
15 years 3 months ago
2008
DM
2008
15 years 3 months ago
2008
111
Voted
CPC
2000
15 years 3 months ago
2000
A recently posed question of H