On theorems of Whitney and Tutte. - Donald K. Wagner (Discret. Math., 1985)

Connectivity in bicircular matroids. - Donald K. Wagner (J. Comb. Theory B, 1985)

Forbidden subgraphs and graph decomposition. - Donald K. Wagner (Networks, 1987)

Equivalent factor matroids of graphs. - Donald K. Wagner (Comb., 1988)

An Almost Linear-Time Algorithm for Graph Realization. - Robert E. Bixby; Donald K. Wagner (Math. Oper. Res., 1988)

Disjoint (s, t)-cuts in a network. - Donald K. Wagner (Networks, 1990)

Decomposing 3-connected graphs. - Collette R. Coullard; Donald K. Wagner (Graph Structure Theory, 1991)

Representations of bicircular matroids. - Collette R. Coullard; John G. Del Greco; Donald K. Wagner (Discret. Appl. Math., 1991)

Vertex 2-isomorphism. - R. Swaminathan; Donald K. Wagner (J. Graph Theory, 1992)

Decomposition of 3-connected graphs. - Collette R. Coullard; L. Leslie Gardner; Donald K. Wagner (Comb., 1993)

Uncovering Generalized-Network Structure in Matrices. - Collette R. Coullard; John G. Del Greco; Donald K. Wagner (Discret. Appl. Math., 1993)

Recognizing a Class of Bicircular Matroids. - Collette R. Coullard; John G. Del Greco; Donald K. Wagner (Discret. Appl. Math., 1993)

A polynomial-time simplex method for the maximum k-flow problem. - Donald K. Wagner; Hong Wan (Math. Program., 1993)

Linear-time algorithms for the 2-connected steiner subgraph problem on special classes of graphs. - Collette R. Coullard; Abdur Rais; Ronald L. Rardin; Donald K. Wagner (Networks, 1993)

On the k-cut subgraph polytope. - Kalyan T. Talluri; Donald K. Wagner (Math. Program., 1994)

On the Consecutive-Retrieval Problem. - R. Swaminathan; Donald K. Wagner (SIAM J. Comput., 1994)

The Arborescence-realization Problem. - Ramjee P. Swaminathan; Donald K. Wagner (Discret. Appl. Math., 1995)

The Dominant of the 2-connected-Steiner-subgraph Polytope for W4-free Graphs. - Collette R. Coullard; Abdur Rais; Ronald L. Rardin; Donald K. Wagner (Discret. Appl. Math., 1996)

Minimum-weight cycles in 3-separable graphs. - Collette R. Coullard; L. Leslie Gardner; Donald K. Wagner (Networks, 1997)

Shortest paths in almost acyclic graphs. - Donald K. Wagner (Oper. Res. Lett., 2000)

Weakly 3-Connected Graphs. - Donald K. Wagner (Comb. Probab. Comput., 2006)

On Mighton's characterization of graphic matroids. - Donald K. Wagner (J. Comb. Theory B, 2010)

Delta-wye reduction of almost-planar graphs. - Donald K. Wagner (Discret. Appl. Math., 2015)

A circuit characterization of graphic matroids. - Donald K. Wagner (J. Comb. Theory B, 2016)

A note on immersion minors and planarity. - Donald K. Wagner (Discret. Math., 2018)

Bipartite and Eulerian minors. - Donald K. Wagner (Eur. J. Comb., 2018)

A Characterization of Graphic Matroids Based on Circuit Orderings. - Donald K. Wagner (SIAM J. Discret. Math., 2018)

Nonseparating Cocircuits in Binary Matroids. - Donald K. Wagner (SIAM J. Discret. Math., 2021)