108 search results - page 7 / 22 » siamdm 2008 |
132
click to vote
SIAMDM
2008
15 years 5 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
110
click to vote
SIAMDM
2008
15 years 5 months ago
2008
We show that every triangle-free graph on the double torus is 4-colorable. This settles a problem raised by Gimbel and Thomassen [Trans. Amer. Math. Soc. 349 (1997), 4555
SIAMDM
2008
15 years 5 months ago
2008
Binary hyper-Kloosterman codes C(r, m) of length (2r - 1)m-1 are a quasi-cyclic
123
click to vote
SIAMDM
2008
15 years 5 months ago
2008
We give exact expressions for the number of coset leaders in the cosets of weight 4 of binary primitive narrow sense Bose