Sciweavers

ARSCOM
1998
104views more  ARSCOM 1998»
13 years 11 months ago
A Note on the Road-Coloring Conjecture
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
E. Gocka, Walter W. Kirchherr, Edward F. Schmeiche...
COMBINATORICS
2007
86views more  COMBINATORICS 2007»
13 years 11 months ago
On Directed Triangles in Digraphs
Using a recent result of Chudnovsky, Seymour, and Sullivan, we slightly improve two bounds related to the Caccetta-Haggkvist Conjecture. Namely, we show that if α ≥ 0.35312, th...
Peter Hamburger, Penny E. Haxell, Alexandr V. Kost...