Further Results on Bar k-Visibility Graphs. - Stephen G. Hartke; Jennifer Vandenbussche; Paul S. Wenger (SIAM J. Discret. Math., 2007)

Rainbow Matching in Edge-Colored Graphs. - Timothy D. LeSaulnier; Christopher J. Stocker; Paul S. Wenger; Douglas B. West (Electron. J. Comb., 2010)

Rainbow Matchings of Size δ(G) in Properly Edge-Colored Graphs. - Jennifer Diemunsch; Michael Ferrara; Allan Lo; Casey Moffatt; Florian Pfender; Paul S. Wenger (Electron. J. Comb., 2012)

Uniquely C 4-Saturated Graphs. - Joshua N. Cooper; John Lenz; Timothy D. LeSaulnier; Paul S. Wenger; Douglas B. West (Graphs Comb., 2012)

Saturation numbers for families of graph subdivisions. - Michael Ferrara; Michael S. Jacobson; Kevin G. Milans; Craig Tennenhouse; Paul S. Wenger (J. Graph Theory, 2012)

Pancyclicity of 4-Connected, Claw-Free, P10-Free Graphs. - Michael Ferrara; Timothy Morris; Paul S. Wenger (J. Graph Theory, 2012)

List distinguishing parameters of trees. - Michael Ferrara; Ellen Gethner; Stephen G. Hartke; Derrick Stolee; Paul S. Wenger (Discret. Appl. Math., 2013)

Conditions for families of disjoint k-connected subgraphs in a graph. - Michael Ferrara; Colton Magnant; Paul S. Wenger (Discret. Math., 2013)

Total Acquisition in Graphs. - Timothy D. LeSaulnier; Noah Prince; Paul S. Wenger; Douglas B. West; Pratik Worah (SIAM J. Discret. Math., 2013)

Total acquisition on grids. - Lori MacDonald; Paul S. Wenger; Scott Wright (Australas. J Comb., 2014)

Fractional acquisition in graphs. - Paul S. Wenger (Discret. Appl. Math., 2014)

A note on the saturation number of the family of k-connected graphs. - Paul S. Wenger (Discret. Math., 2014)

On the sum necessary to ensure that a degree sequence is potentially H-graphic. - Michael J. Ferrara; Timothy D. LeSaulnier; Casey Moffatt; Paul S. Wenger (Comb., 2016)

Multiple-View Spectral Clustering for Group-wise Functional Community Detection. - Nathan D. Cahill; Harmeet Singh; Chao Zhang; Daryl A. Corcoran; Alison M. Prengaman; Paul S. Wenger; John F. Hamilton; Peter Bajorski; Andrew M. Michael (CoRR, 2016)

The Unit Bar Visibility Number of a Graph. - Emily Gaub; Michelle Rose; Paul S. Wenger (J. Graph Algorithms Appl., 2016)

The list distinguishing number equals the distinguishing number for interval graphs. - Poppy Immel; Paul S. Wenger (Discuss. Math. Graph Theory, 2017)

Unit Hypercube Visibility Numbers of Trees. - Eric Peterson; Paul S. Wenger (Graphs Comb., 2017)

Colored Saturation Parameters for Rainbow Subgraphs. - Michael D. Barrus; Michael Ferrara; Jennifer Vandenbussche; Paul S. Wenger (J. Graph Theory, 2017)

Planar Digraphs without Large Acyclic Sets. - Kolja Knauer; Petru Valicov; Paul S. Wenger (J. Graph Theory, 2017)

Saturation Numbers in Tripartite Graphs. - Eric Sullivan; Paul S. Wenger (J. Graph Theory, 2017)

Uniquely Cycle-Saturated Graphs. - Paul S. Wenger; Douglas B. West (J. Graph Theory, 2017)

Extending precolorings to distinguish group actions. - Michael Ferrara; Ellen Gethner; Stephen G. Hartke; Derrick Stolee; Paul S. Wenger (Eur. J. Comb., 2018)

Stability of the Potential Function. - Catherine Erbes; Michael Ferrara; Ryan R. Martin; Paul S. Wenger (SIAM J. Discret. Math., 2018)

The unit acquisition number of a graph. - Frederick Johnson; Anna Raleigh; Paul S. Wenger; Douglas B. West (Discret. Appl. Math., 2019)

List-distinguishing Cartesian products of cliques. - Michael Ferrara; Zoltán Füredi; Sogol Jahanbekam; Paul S. Wenger (Discret. Math., 2019)

Weak Dynamic Coloring of Planar Graphs. - Caroline Accurso; Vitaliy Chernyshov; Leaha Hand; Sogol Jahanbekam; Paul S. Wenger (Graphs Comb., 2024)