The hub number of a graph. - Tracy Grauman; Stephen G. Hartke; Adam S. Jobson; William B. Kinnersley; Douglas B. West; Lesley Wiglesworth; Pratik Worah; Hehui Wu (Inf. Process. Lett., 2008)

Stack Domination Density. - Timothy Brauch; Paul Horn; Adam S. Jobson; D. Jacob Wildstrom (Graphs Comb., 2013)

Connected matchings in chordal bipartite graphs. - Adam S. Jobson; André E. Kézdy; Susan C. White (Discret. Optim., 2014)

Detour trees. - Adam S. Jobson; André E. Kézdy; Jenö Lehel; Susan C. White (Discret. Appl. Math., 2016)

Variations on Narrow Dots-and-Boxes and Dots-and-Triangles. - Adam S. Jobson; Levi Sledd; Susan Calcote White; D. Jacob Wildstrom (Integers, 2017)

The minimum size of graphs satisfying cut conditions. - Adam S. Jobson; André E. Kézdy; Jeno Lehel (Discret. Appl. Math., 2018)

Linkage on the infinite grid. - Adam S. Jobson; André E. Kézdy; Jeno Lehel (Inf. Process. Lett., 2018)

The path-pairability number of products of stars. - Adam S. Jobson; André E. Kézdy; Jeno Lehel; Gábor Mészáros (Discuss. Math. Graph Theory, 2019)

Note on the bisection width of cubic graphs. - Adam S. Jobson; André E. Kézdy; Jeno Lehel (Discret. Appl. Math., 2020)

Petruska's question on planar convex sets. - Adam S. Jobson; André E. Kézdy; Jeno Lehel; Timothy J. Pervenecki; Géza Tóth 001 (Discret. Math., 2020)

All Minor-Minimal Apex Obstructions with Connectivity Two. - Adam S. Jobson; André E. Kézdy (Electron. J. Comb., 2021)

Eckhoff's Problem on Convex Sets in the Plane. - Adam S. Jobson; André E. Kézdy; Jeno Lehel (Electron. J. Comb., 2021)

Minimal 2-connected graphs satisfying the even cut condition. - Adam S. Jobson; André E. Kézdy; Jeno Lehel (Inf. Process. Lett., 2021)

Path-pairability of infinite planar grids. - Adam S. Jobson; André E. Kézdy; Jeno Lehel (Period. Math. Hung., 2021)

Systems of Overlap Representation for Families of Intervals. - Adam S. Jobson; André E. Kézdy; Kevin G. Milans; Douglas B. West; D. Jacob Wildstrom (Graphs Comb., 2022)