Decycling graphs. - Lowell W. Beineke; Robert C. Vandell (J. Graph Theory, 1997)

No Cycling in the Graphs! - Lowell W. Beineke; Robert C. Vandell (Electron. Notes Discret. Math., 2002)

Maximum Arc-integrity of Tournaments and Bipartite Tournaments. - Robert C. Vandell (Electron. Notes Discret. Math., 2002)

Routing sets in the integer lattice. - Peter Hamburger; Robert C. Vandell; Matt Walsh 001 (Discret. Appl. Math., 2007)

Hamiltonicity and restricted block-intersection graphs of t-designs. - David A. Pike; Robert C. Vandell; Matthew Walsh 001 (Discret. Math., 2009)

Decycling Bipartite Tournaments by Deleting Arcs. - Robert C. Vandell (Ars Comb., 2014)

On Compact Symmetric Regularizations of Graphs. - Robert C. Vandell; Matt Walsh 001; William D. Weakley (Electron. J. Comb., 2014)