Sciweavers

116 search results - page 3 / 24
» A Note on Cycle Lengths in Graphs
Sort
View
JGT
2010
135views more  JGT 2010»
13 years 6 months ago
Cycle length parities and the chromatic number
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
Christian Löwenstein, Dieter Rautenbach, Ingo...
ENDM
2008
114views more  ENDM 2008»
13 years 7 months ago
Strong oriented chromatic number of planar graphs without cycles of specific lengths
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...
Mickaël Montassier, Pascal Ochem, Alexandre P...
COMBINATORICA
2008
93views more  COMBINATORICA 2008»
13 years 7 months ago
Cycle lengths in sparse graphs
Benny Sudakov, Jacques Verstraëte
CPC
2000
82views more  CPC 2000»
13 years 7 months ago
On Arithmetic Progressions Of Cycle Lengths In Graphs
A recently posed question of H
Jacques Verstraëte