Intersection numbers of bipartite distance-regular graphs. - John S. Caughman IV (Discret. Math., 1997)

Spectra of Bipartite P- and Q-Polynomial Association Schemes. - John S. Caughman IV (Graphs Comb., 1998)

The Terwilliger algebras of bipartite P- and Q-polynomial schemes. - John S. Caughman IV (Discret. Math., 1999)

Bipartite Q-Polynomial Quotients of Antipodal Distance-Regular Graphs. - John S. Caughman IV (J. Comb. Theory B, 1999)

The Multiplicities of a Dual-thin Q-polynomial Association Scheme. - Bruce E. Sagan; John S. Caughman IV (Electron. J. Comb., 2001)

The last subconstituent of a bipartite Q-polynomial distance-regular graph. - John S. Caughman IV (Eur. J. Comb., 2003)

Graph theoretic methods in the stability of vehicle formations. - Gerardo Lafferriere; John S. Caughman IV; Anca Williams (ACC, 2004)

Bipartite Q-Polynomial Distance-Regular Graphs. - John S. Caughman IV (Graphs Comb., 2004)

The Terwilliger algebra of an almost-bipartite P- and Q-polynomial association scheme. - John S. Caughman IV; Mark S. MacLean; Paul M. Terwilliger (Discret. Math., 2005)

Decentralized control of vehicle formations. - Gerardo Lafferriere; Alan Williams; John S. Caughman IV; J. J. Peter Veerman (Syst. Control. Lett., 2005)

Kernels of Directed Graph Laplacians. - John S. Caughman IV; J. J. Peter Veerman (Electron. J. Comb., 2006)

The last subconstituent of the Hemmeter graph. - John S. Caughman IV; Elizabeth J. Hart; Jianmin Ma (Discret. Math., 2008)

A note on lattice chains and Delannoy numbers. - John S. Caughman IV; Clifford R. Haithcock; J. J. Peter Veerman (Discret. Math., 2008)

Reversible Function Synthesis of Large Reversible Functions with No Ancillary Bits Using Covering Set Partitions. - Maher Hawash; Marek A. Perkowski; Steve Bleiler; John S. Caughman IV; Amjad Hawash (ITNG, 2011)

Counting lattice chains and Delannoy paths in higher dimensions. - John S. Caughman IV; Charles L. Dunn; Nancy Ann Neudauer; Colin L. Starr (Discret. Math., 2011)

Configuration Symmetry and Performance Upper Bound of One-Dimensional Cellular Automata for the Leader Election Problem. - Peter Banda; John S. Caughman IV; Jiri Pospichal (J. Cell. Autom., 2015)

Towards a complete characterization of vulnerability of networked synchronization processes. - Rahul Dhal; Gerardo Lafferriere; John S. Caughman IV (CDC, 2016)

An Improved Factorization Approach to Reversible Circuit Synthesis Based on EXORs of Products of EXORs. - Linh Tran; Addison Gronquist; Marek A. Perkowski; John S. Caughman IV (ISMVL, 2016)

Cycle Structures of Orthomorphisms Extending Partial Orthomorphisms of Boolean Groups. - Nichole L. Schimanski; John S. Caughman IV (Electron. J. Comb., 2016)

Spanning Tree Decompositions of Complete Graphs Orthogonal to Rotational 1-Factorizations. - John S. Caughman IV; John Krussel; James Mahoney (Graphs Comb., 2017)

On the girth and diameter of generalized Johnson graphs. - Louis Anthony Agong; Carmen Amarra; John S. Caughman IV; Ari J. Herman; Taiyo S. Terada (Discret. Math., 2018)

Probability Axioms and Set Theory Paradoxes. - Ari J. Herman; John S. Caughman IV (Symmetry, 2021)

Area, perimeter, height, and width of rectangle visibility graphs. - John S. Caughman IV; Charles L. Dunn; Joshua D. Laison; Nancy Ann Neudauer; Colin L. Starr (J. Comb. Optim., 2023)

The odd girth of generalized Johnson graphs. - John S. Caughman IV; Ari J. Herman; Taiyo S. Terada (Discret. Math., 2024)