Arrangements and the crossing number of Cm x Cn
J. Combin. Theory, Ser. B 90 (2004), no. 1, 21 - 39
(with J. Adamsson)
Crossing Numbers
A survey, in Topics in Topological Graph Theory, L.W. Beineke and R. Wilson, eds
(with G. Salazar)
The convex hull of every optimal pseudolinear drawing of Kn is a triangle
Australas. J. Combin. 38 (2007), 155--162
(with J. Balogh, J. Leaños, S. Pan, and G. Salazar)
Improved bounds for the crossing numbers of K{m,n} and Kn
SIAM J. Discrete Math. 20 (2006), no. 1, 189--202
(with E. de Klerk, J. Mahaffey, D.V. Pasechnik, and G. Salazar)
The crossing number of K(11) is 100
J. Graph Theory 56 (2007), no. 2, 128--134
(with S. Pan) (get code)
Crossing number of sequences of graphs II: planar tiles
J. Graph Theory 42 (2003), no. 4, 332 - 341
(with B. Pinontoan)
Crossing number of sequences of graphs I: general tiles
Australas. J. Combin. 30 (2004), 197 - 206
(with B. Pinontoan)
The crossing number of C6 x Cn
Australas. J. Combin. 23 (2001) 135 - 143
(with G. Salazar)
On essential and inessential polygons in embedded graphs
Journal of Combinatorial Theory Series B 84 (2002), no.
1, 100--117
(with R.P. Vitray)
3-connected planar spaces uniquely embed in the sphere
Trans. Amer. Math. Soc. 354 (2002), no. 11, 4585--4595
(with C. Thomassen)
Graphs embedded in the plane with boundedly many accumulation points
J. Graph Theory
44 (2003), no. 2, 132 - 147
(with C.P. Bonnington)
\nxt{R. Christian, R.B. Richter and B. Rooney, The theorems of MacLane and Whitney for graph-like spaces, to appear, {\it Electron.\ J.\ Combin.}}