New flip-flop construction for hypohamilton graphs. - J. B. Collier; Edward F. Schmeichel (Discret. Math., 1977)

On the connectivity of maximal planar graphs. - Seifollah Louis Hakimi; Edward F. Schmeichel (J. Graph Theory, 1978)

Systematic searches for hypohamiltonian graphs. - J. B. Collier; Edward F. Schmeichel (Networks, 1978)

Connectivity, genus, and the number of components in vertex-deleted subgraphs. - Edward F. Schmeichel; Gary S. Bloom (J. Comb. Theory B, 1979)

On the number of cycles of length k in a maximal planar graph. - Seifollah Louis Hakimi; Edward F. Schmeichel (J. Graph Theory, 1979)

On the number of hamiltonian cycles in a maximal planar graph. - Seifollah Louis Hakimi; Edward F. Schmeichel; Carsten Thomassen (J. Graph Theory, 1979)

The basis number of a graph. - Edward F. Schmeichel (J. Comb. Theory B, 1981)

On the maximum number of independent edges in cubic graphs. - Arthur M. Hobbs; Edward F. Schmeichel (Discret. Math., 1982)

Bipartite graphs with cycles of all even lengths. - Edward F. Schmeichel; John Mitchem (J. Graph Theory, 1982)

An Adaptive Algorithm for System Level Diagnosis. - S. Louis Hakimi; Edward F. Schmeichel (J. Algorithms, 1984)

On minimizing testing rounds for fault identification. - Edward F. Schmeichel; S. Louis Hakimi; M. Otsuka; Geoff Sullivan (FTCS, 1988)

A cycle structure theorem for hamiltonian graphs. - Edward F. Schmeichel; S. Louis Hakimi (J. Comb. Theory B, 1988)

Chromatic factorizations of a graph. - S. Louis Hakimi; Edward F. Schmeichel (J. Graph Theory, 1988)

A Note on the Vertex Arboricity of a Graph. - S. Louis Hakimi; Edward F. Schmeichel (SIAM J. Discret. Math., 1989)

Recognizing tough graphs is NP-hard. - Douglas Bauer; S. Louis Hakimi; Edward F. Schmeichel (Discret. Appl. Math., 1990)

A simple proof of a theorem of Jung. - Douglas Bauer; Aurora Morgana; Edward F. Schmeichel (Discret. Math., 1990)

Long cycles in graphs with large degree sums. - Douglas Bauer; Henk Jan Veldman; Aurora Morgana; Edward F. Schmeichel (Discret. Math., 1990)

Parallel Algorithms for Gossiping by Mail. - Anindo Bagchi; S. Louis Hakimi; John Mitchem; Edward F. Schmeichel (Inf. Process. Lett., 1990)

A Parallel Fault Identification Algorithm. - Edward F. Schmeichel; S. Louis Hakimi; M. Otsuka; Geoff Sullivan (J. Algorithms, 1990)

Hamiltonian degree conditions which imply a graph is pancyclic. - Douglas Bauer; Edward F. Schmeichel (J. Comb. Theory B, 1990)

Parallel algorithms for information dissemination by packets. - Anindo Bagchi; Edward F. Schmeichel; S. Louis Hakimi (SPDP, 1991)

Fitting polygonal functions to a set of points in the plane. - S. Louis Hakimi; Edward F. Schmeichel (CVGIP Graph. Model. Image Process., 1991)

On felicitous graphs. - Sin-Min Lee; Edward F. Schmeichel; Sze-Chin Shee (Discret. Math., 1991)

The Voronoi Partition of a Network and Its Implications in Location Theory. - S. Louis Hakimi; Martine Labbé; Edward F. Schmeichel (INFORMS J. Comput., 1992)

Sequential information dissemination by packets. - Anindo Bagchi; Edward F. Schmeichel; S. Louis Hakimi (Networks, 1992)

On locating path- or tree-shaped facilities on networks. - S. Louis Hakimi; Edward F. Schmeichel; Martine Labbé (Networks, 1993)

On Minimum Fault-Tolerant Networks. - S. Ueno; Anindo Bagchi; S. Louis Hakimi; Edward F. Schmeichel (SIAM J. Discret. Math., 1993)

Gossigping in a Distributed Network. - Anindo Bagchi; S. Louis Hakimi; Edward F. Schmeichel (IEEE Trans. Computers, 1993)

On the complexity of recognizing tough graphs. - Douglas Bauer; Aurora Morgana; Edward F. Schmeichel (Discret. Math., 1994)

Toughness, minimum degree, and the existence of 2-factors. - Douglas Bauer; Edward F. Schmeichel (J. Graph Theory, 1994)

Approximation algorithms for the capacitated plant allocation problem. - Martine Labbé; Edward F. Schmeichel; S. Louis Hakimi (Oper. Res. Lett., 1994)

Parallel Information Dissemination by Packets. - Anindo Bagchi; Edward F. Schmeichel; S. Louis Hakimi (SIAM J. Comput., 1994)

Toughness and Triangle-Free Graphs. - Douglas Bauer; Jan van den Heuvel; Edward F. Schmeichel (J. Comb. Theory B, 1995)

Degree-bounded coloring of graphs: Variations on a theme by brooks. - S. Louis Hakimi; John Mitchem; Edward F. Schmeichel (J. Graph Theory, 1995)

Gossiping with Multiple Sends and Receives. - Anindo Bagchi; Edward F. Schmeichel; S. Louis Hakimi (Discret. Appl. Math., 1996)

A note on dominating cycles in 2-connected graphs. - Douglas Bauer; Edward F. Schmeichel; Henk Jan Veldman (Discret. Math., 1996)

Star arboricity of graphs. - S. Louis Hakimi; John Mitchem; Edward F. Schmeichel (Discret. Math., 1996)

2-factors in triangle-free graphs. - Douglas Bauer; Jan van den Heuvel; Edward F. Schmeichel (J. Graph Theory, 1996)

Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126]. - Martine Labbé; Edward F. Schmeichel; S. Louis Hakimi (Oper. Res. Lett., 1996)

The Complexity of Recognizing Tough Cubic Graphs. - Douglas Bauer; Jan van den Heuvel; Aurora Morgana; Edward F. Schmeichel (Discret. Appl. Math., 1997)

On the cost chromatic number of outerplanar, planar, and line graphs. - John Mitchem; Patrick Morriss; Edward F. Schmeichel (Discuss. Math. Graph Theory, 1997)

Orienting Graphs to Optimize Reachability. - S. Louis Hakimi; Edward F. Schmeichel; Neal E. Young (Inf. Process. Lett., 1997)

Locating replicas of a database on a network. - S. Louis Hakimi; Edward F. Schmeichel (Networks, 1997)

A Note on the Road-Coloring Conjecture. - E. Gocka; Walter W. Kirchherr; Edward F. Schmeichel (Ars Comb., 1998)

Short Proofs of Theorems of Nash-Williams and Tutte. - S. Louis Hakimi; John Mitchem; Edward F. Schmeichel (Ars Comb., 1998)

Improved bounds for the chromatic index of graphs and multigraphs. - S. Louis Hakimi; Edward F. Schmeichel (J. Graph Theory, 1999)

Locations on time-varying networks. - S. Louis Hakimi; Martine Labbé; Edward F. Schmeichel (Networks, 1999)

An Identity Involving Derangements: 10643. - David Callan; Knut Dale; Ivar Skau; John Henry Steelman; Jany C. Binz; Robin J. Chapman; F. Herzig; André Kündgen; Reiner Martin; José Heber Nieto; O. A. Saleh; S. Byrd; et al. (Am. Math. Mon., 2000)

Tiling Rectangles with Trominoes: 10641. - Jerrold R. Griggs; Michael Woltermann; B. Borchers; David Callan; Robin J. Chapman; J. Chilcott; Paul Cull; A. Ferguson; K. Martin; G. G. Gagola; Solomon W. Golomb; J. Guilford; et al. (Am. Math. Mon., 2000)

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. - Douglas Bauer; Hajo Broersma; Aurora Morgana; Edward F. Schmeichel (Discret. Appl. Math., 2002)

More Progress on Tough Graphs - The Y2K Report. - Douglas Bauer; Hajo Broersma; Edward F. Schmeichel (Electron. Notes Discret. Math., 2002)

The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees. - John Mitchem; Edward F. Schmeichel (Electron. Notes Discret. Math., 2002)

Bounds for the chromatic number of graphs with partial information. - William C. Coffman; S. Louis Hakimi; Edward F. Schmeichel (Discret. Math., 2003)

Toughness, minimum degree, and spanning cubic subgraphs. - Douglas Bauer; T. Niessen; Edward F. Schmeichel (J. Graph Theory, 2004)

Improved bounds for the chromatic number of a graph. - S. Louis Hakimi; Edward F. Schmeichel (J. Graph Theory, 2004)

Toughness in Graphs - A Survey. - Douglas Bauer; Hajo Broersma; Edward F. Schmeichel (Graphs Comb., 2006)

Subdivision of Edges and Matching Size. - Douglas Bauer; Edward F. Schmeichel; Thomas M. Surowiec (Ars Comb., 2007)

Tutte sets in graphs II: The complexity of finding maximum Tutte sets. - Douglas Bauer; Hajo Broersma; Nathan Kahl; Aurora Morgana; Edward F. Schmeichel; Thomas M. Surowiec (Discret. Appl. Math., 2007)

Tutte sets in graphs I: Maximal tutte sets and D-graphs. - Douglas Bauer; Hajo Broersma; Aurora Morgana; Edward F. Schmeichel (J. Graph Theory, 2007)

Long Cycles in 2-Connected Triangle-Free Graphs. - Douglas Bauer; Nathan Kahl; Linda E. McGuire; Edward F. Schmeichel (Ars Comb., 2008)

Sufficient degree conditions for k-edge-connectedness of a graph. - Douglas Bauer; S. Louis Hakimi; Nathan Kahl; Edward F. Schmeichel (Networks, 2009)

Best monotone degree conditions for binding number. - Douglas Bauer; Michael Yatauro; Nathan Kahl; Edward F. Schmeichel (Discret. Math., 2011)

Degree Sequences and the Existence of k-Factors. - Douglas Bauer; Haitze J. Broersma; Jan van den Heuvel; Nathan Kahl; Edward F. Schmeichel (Graphs Comb., 2012)

Binding Number, Minimum Degree, and Cycle Structure in Graphs. - Douglas Bauer; Edward F. Schmeichel (J. Graph Theory, 2012)

Toughness and Vertex Degrees. - Douglas Bauer; Haitze J. Broersma; Jan van den Heuvel; Nathan Kahl; Edward F. Schmeichel (J. Graph Theory, 2013)

Toughness and binding number. - Douglas Bauer; Nathan Kahl; Edward F. Schmeichel; Douglas R. Woodall; Michael Yatauro (Discret. Appl. Math., 2014)

Best monotone degree conditions for binding number and cycle structure. - Douglas Bauer; Aori Nevo; Edward F. Schmeichel; Douglas R. Woodall; Michael Yatauro (Discret. Appl. Math., 2015)

Best Monotone Degree Conditions for Graph Properties: A Survey. - Douglas Bauer; Hajo Broersma; Jan van den Heuvel; Nathan Kahl; Aori Nevo; Edward F. Schmeichel; Douglas R. Woodall; Michael Yatauro (Graphs Comb., 2015)

Vertex Arboricity and Vertex Degrees. - Douglas Bauer; Aori Nevo; Edward F. Schmeichel (Graphs Comb., 2016)

Best Monotone Degree Condition for the Hamiltonicity of Graphs with a 2-Factor. - Douglas Bauer; Aori Nevo; Edward F. Schmeichel (Graphs Comb., 2017)

On the necessity of Chvátal's Hamiltonian degree condition. - Douglas Bauer; Linda M. Lesniak; Aori Nevo; Edward F. Schmeichel (AKCE Int. J. Graphs Comb., 2020)

A generalization of a theorem of Nash-Williams. - Douglas Bauer; Linda M. Lesniak; Edward F. Schmeichel (Graphs Comb., 2022)