The spanning subgraphs of eulerian graphs. - Francis T. Boesch; Charles L. Suffel; Ralph Tindell (J. Graph Theory, 1977)

Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity. - Francis T. Boesch; Charles L. Suffel (J. Graph Theory, 1980)

Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity. - Francis T. Boesch; Charles L. Suffel (Discret. Appl. Math., 1981)

Realizability of p-point, q-line graphs with prescribed point connectivity, line connectivity, or minimum degree. - Francis T. Boesch; Charles L. Suffel (Networks, 1982)

Domination alteration sets in graphs. - Douglas Bauer; Frank Harary; Juhani Nieminen; Charles L. Suffel (Discret. Math., 1983)

Combinatorial optimization problems in the analysis and design of probabilistic networks. - Douglas Bauer; Frank Boesch; Charles L. Suffel; Ralph Tindell (Networks, 1985)

On Residual Connectedness Network Reliability. - Francis T. Boesch; Appajosyula Satyanarayana; Charles L. Suffel (Reliability Of Computer And Communication Networks, 1989)

Least reliable networks and the reliability domination. - Francis T. Boesch; Appajosyula Satyanarayana; Charles L. Suffel (IEEE Trans. Commun., 1990)

On the existence of uniformly optimally reliable networks. - Francis T. Boesch; Xiaoming Li 001; Charles L. Suffel (Networks, 1991)

The Complexity of the Residual Node Connectedness Reliability Problem. - Klaus Sutner; Appajosyula Satyanarayana; Charles L. Suffel (SIAM J. Comput., 1991)

A reliability-improving graph transformation with applications to network reliability. - Appajosyula Satyanarayana; L. Schoppmann; Charles L. Suffel (Networks, 1992)

Computing Residual Connectedness Reliability for Restricted Networks. - Charles J. Colbourn; Appajosyula Satyanarayana; Charles L. Suffel; Klaus Sutner (Discret. Appl. Math., 1993)

Cayley Graphs with Neighbor Connectivity One. - Lynne L. Doty; R. J. Goldstone; Charles L. Suffel (SIAM J. Discret. Math., 1996)

A coherent model for reliability of multiprocessor networks. - Frank Boesch; Daniel Gross; Charles L. Suffel (IEEE Trans. Reliab., 1996)

On the characterization of graphs with maximum number of spanning trees. - Louis Petingi; Frank Boesch; Charles L. Suffel (Discret. Math., 1998)

Realizability Results Involving Two Connectivity Parameters. - L. William Kazmierczak; Frank Boesch; Daniel Gross; Charles L. Suffel (Ars Comb., 2007)

A generalization of an edge-connectivity theorem of Chartrand. - Frank Boesch; Daniel Gross; John T. Saccoman; L. William Kazmierczak; Charles L. Suffel; Antonius Suhartomo (Networks, 2009)

A survey of some network reliability analysis and synthesis results. - Francis T. Boesch; Appajosyula Satyanarayana; Charles L. Suffel (Networks, 2009)

A eulogy for Frank Boesch. - Charles L. Suffel (Networks, 2009)

On Component Order Edge Connectivity Of a Complete Bipartite Graph. - Daniel Gross; L. William Kazmierczak; John T. Saccoman; Charles L. Suffel; Antonius Suhartomo (Ars Comb., 2013)