The crossing number of Cm × Cn is as conjectured for n ≥ m(m + 1).Published in:Journal of Graph Theory, 2004, v. 47, n. 1, p. 53By:Lev Yu. Glebsky;Gelasio SalazarPublication type:Article
Cycles and paths in graphs with large minimal degree.Published in:Journal of Graph Theory, 2004, v. 47, n. 1, p. 39By:V. Nikiforov;R. H. SchelpPublication type:Article