Edward F. Schmeichel

Publication Activity (10 Years)

Years Active: 1977-2022
Publications (10 Years): 6

Top Topics

Graph Properties

Strictly Convex

Top Venues

Discret. Appl. Math.

J. Graph Theory

AKCE Int. J. Graphs Comb.

Publications

Douglas Bauer, Linda M. Lesniak, Edward F. Schmeichel
A generalization of a theorem of Nash-Williams. Graphs Comb. 38 (6) (2022)
Douglas Bauer, Linda M. Lesniak, Aori Nevo, Edward F. Schmeichel
On the necessity of Chvátal's Hamiltonian degree condition. AKCE Int. J. Graphs Comb. 17 (2) (2020)
Douglas Bauer, Aori Nevo, Edward F. Schmeichel
Best Monotone Degree Condition for the Hamiltonicity of Graphs with a 2-Factor. Graphs Comb. 33 (5) (2017)
Douglas Bauer, Aori Nevo, Edward F. Schmeichel
Vertex Arboricity and Vertex Degrees. Graphs Comb. 32 (5) (2016)
Douglas Bauer, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro
Best monotone degree conditions for binding number and cycle structure. Discret. Appl. Math. 195 (2015)
Douglas Bauer, Hajo Broersma, Jan van den Heuvel, Nathan Kahl, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro
Best Monotone Degree Conditions for Graph Properties: A Survey. Graphs Comb. 31 (1) (2015)
Douglas Bauer, Nathan Kahl, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro
Toughness and binding number. Discret. Appl. Math. 165 (2014)
Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel
Toughness and Vertex Degrees. J. Graph Theory 72 (2) (2013)
Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel
Degree Sequences and the Existence of k-Factors. Graphs Comb. 28 (2) (2012)
Douglas Bauer, Edward F. Schmeichel
Binding Number, Minimum Degree, and Cycle Structure in Graphs. J. Graph Theory 71 (2) (2012)
Douglas Bauer, Michael Yatauro, Nathan Kahl, Edward F. Schmeichel
Best monotone degree conditions for binding number. Discret. Math. 311 (18-19) (2011)
Douglas Bauer, S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel
-edge-connectedness of a graph. Networks 54 (2) (2009)
Douglas Bauer, Nathan Kahl, Linda E. McGuire, Edward F. Schmeichel
Long Cycles in 2-Connected Triangle-Free Graphs. Ars Comb. 86 (2008)
Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, Thomas M. Surowiec
Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discret. Appl. Math. 155 (10) (2007)
Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel
Tutte sets in graphs I: Maximal tutte sets and D-graphs. J. Graph Theory 55 (4) (2007)
Douglas Bauer, Edward F. Schmeichel, Thomas M. Surowiec
Subdivision of Edges and Matching Size. Ars Comb. 84 (2007)
Douglas Bauer, Hajo Broersma, Edward F. Schmeichel
Toughness in Graphs - A Survey. Graphs Comb. 22 (1) (2006)
Douglas Bauer, T. Niessen, Edward F. Schmeichel
Toughness, minimum degree, and spanning cubic subgraphs. J. Graph Theory 46 (2) (2004)
Douglas Bauer, T. Niessen, Edward F. Schmeichel
Toughness, minimum degree, and spanning cubic subgraphs. J. Graph Theory 45 (2) (2004)
S. Louis Hakimi, Edward F. Schmeichel
Improved bounds for the chromatic number of a graph. J. Graph Theory 47 (3) (2004)
William C. Coffman, S. Louis Hakimi, Edward F. Schmeichel
Bounds for the chromatic number of graphs with partial information. Discret. Math. 263 (1-3) (2003)
S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
Orienting Graphs to Optimize Reachability CoRR (2002)
Douglas Bauer, Hajo Broersma, Edward F. Schmeichel
More Progress on Tough Graphs - The Y2K Report. Electron. Notes Discret. Math. 11 (2002)
Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discret. Appl. Math. 120 (1-3) (2002)
John Mitchem, Edward F. Schmeichel
The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees. Electron. Notes Discret. Math. 11 (2002)
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, S. Louis Hakimi, Edward F. Schmeichel, J. K. Haugland, C. H. Jepson, R. Johnsonbaugh, André Kündgen, S. Levandosky, J. T. Lewis, John H. Lindsey II, O. P. Lossers, Reiner Martin, R. Morris, Gerald Myerson, José Heber Nieto, E. Rykken, J. Sorensen, J. Schlosberg, W. Seaman, J. T. Ward, Z. Zeuge
Tiling Rectangles with Trominoes: 10641. Am. Math. Mon. 107 (2) (2000)
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, Edward F. Schmeichel, Isaac Sofair, Michael Vowe
An Identity Involving Derangements: 10643. Am. Math. Mon. 107 (3) (2000)
S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel
Locations on time-varying networks. Networks 34 (4) (1999)
S. Louis Hakimi, Edward F. Schmeichel
Improved bounds for the chromatic index of graphs and multigraphs. J. Graph Theory 32 (4) (1999)
S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
Short Proofs of Theorems of Nash-Williams and Tutte. Ars Comb. 50 (1998)
E. Gocka, Walter W. Kirchherr, Edward F. Schmeichel
A Note on the Road-Coloring Conjecture. Ars Comb. 49 (1998)
Douglas Bauer, Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel
The Complexity of Recognizing Tough Cubic Graphs. Discret. Appl. Math. 79 (1-3) (1997)
S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
Orienting Graphs to Optimize Reachability. Inf. Process. Lett. 63 (5) (1997)
John Mitchem, Patrick Morriss, Edward F. Schmeichel
On the cost chromatic number of outerplanar, planar, and line graphs. Discuss. Math. Graph Theory 17 (2) (1997)
S. Louis Hakimi, Edward F. Schmeichel
Locating replicas of a database on a network. Networks 30 (1) (1997)
Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman
A note on dominating cycles in 2-connected graphs. Discret. Math. 155 (1-3) (1996)
Martine Labbé, Edward F. Schmeichel, S. Louis Hakimi
Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126]. Oper. Res. Lett. 18 (4) (1996)
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
Gossiping with Multiple Sends and Receives. Discret. Appl. Math. 64 (2) (1996)
Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel
2-factors in triangle-free graphs. J. Graph Theory 21 (4) (1996)
S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
Star arboricity of graphs. Discret. Math. 149 (1-3) (1996)
S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
Degree-bounded coloring of graphs: Variations on a theme by brooks. J. Graph Theory 20 (2) (1995)
Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel
Toughness and Triangle-Free Graphs. J. Comb. Theory, Ser. B 65 (2) (1995)
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
Gossiping with Multiple Sends and Receives. IPPS (1994)
Douglas Bauer, Aurora Morgana, Edward F. Schmeichel
On the complexity of recognizing tough graphs. Discret. Math. 124 (1-3) (1994)
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
Parallel Information Dissemination by Packets. SIAM J. Comput. 23 (2) (1994)
Douglas Bauer, Edward F. Schmeichel
Toughness, minimum degree, and the existence of 2-factors. J. Graph Theory 18 (3) (1994)
Martine Labbé, Edward F. Schmeichel, S. Louis Hakimi
Approximation algorithms for the capacitated plant allocation problem. Oper. Res. Lett. 15 (3) (1994)
Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel
Gossigping in a Distributed Network. IEEE Trans. Computers 42 (2) (1993)
S. Louis Hakimi, Edward F. Schmeichel, Martine Labbé
On locating path- or tree-shaped facilities on networks. Networks 23 (6) (1993)
S. Ueno, Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel
On Minimum Fault-Tolerant Networks. SIAM J. Discret. Math. 6 (4) (1993)
S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel
The Voronoi Partition of a Network and Its Implications in Location Theory. INFORMS J. Comput. 4 (4) (1992)
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
Sequential information dissemination by packets. Networks 22 (4) (1992)
Sin-Min Lee, Edward F. Schmeichel, S. C. Shee
On felicitous graphs. Discret. Math. 93 (2-3) (1991)
S. Louis Hakimi, Edward F. Schmeichel
Fitting polygonal functions to a set of points in the plane. CVGIP Graph. Model. Image Process. 53 (2) (1991)
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
Parallel algorithms for information dissemination by packets. SPDP (1991)
Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel
Long cycles in graphs with large degree sums. Discret. Math. 79 (1) (1990)
Douglas Bauer, Edward F. Schmeichel
Hamiltonian degree conditions which imply a graph is pancyclic. J. Comb. Theory, Ser. B 48 (1) (1990)
Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
Parallel Algorithms for Gossiping by Mail. Inf. Process. Lett. 34 (4) (1990)
Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel
Recognizing tough graphs is NP-hard. Discret. Appl. Math. 28 (3) (1990)
Douglas Bauer, Aurora Morgana, Edward F. Schmeichel
A simple proof of a theorem of Jung. Discret. Math. 79 (2) (1990)
Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan
A Parallel Fault Identification Algorithm. J. Algorithms 11 (2) (1990)
S. Louis Hakimi, Edward F. Schmeichel
A Note on the Vertex Arboricity of a Graph. SIAM J. Discret. Math. 2 (1) (1989)
S. Louis Hakimi, Edward F. Schmeichel
Chromatic factorizations of a graph. J. Graph Theory 12 (2) (1988)
Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan
On minimizing testing rounds for fault identification. FTCS (1988)
Edward F. Schmeichel, S. Louis Hakimi
A cycle structure theorem for hamiltonian graphs. J. Comb. Theory, Ser. B 45 (1) (1988)
S. Louis Hakimi, Edward F. Schmeichel
An Adaptive Algorithm for System Level Diagnosis. J. Algorithms 5 (4) (1984)
Arthur M. Hobbs, Edward F. Schmeichel
On the maximum number of independent edges in cubic graphs. Discret. Math. 42 (2-3) (1982)
Edward F. Schmeichel, John Mitchem
Bipartite graphs with cycles of all even lengths. J. Graph Theory 6 (4) (1982)
Edward F. Schmeichel
The basis number of a graph. J. Comb. Theory, Ser. B 30 (2) (1981)
Seifollah Louis Hakimi, Edward F. Schmeichel
in a maximal planar graph. J. Graph Theory 3 (1) (1979)
Seifollah Louis Hakimi, Edward F. Schmeichel, Carsten Thomassen
On the number of hamiltonian cycles in a maximal planar graph. J. Graph Theory 3 (4) (1979)
Edward F. Schmeichel, Gary S. Bloom
Connectivity, genus, and the number of components in vertex-deleted subgraphs. J. Comb. Theory, Ser. B 27 (2) (1979)
J. B. Collier, Edward F. Schmeichel
Systematic searches for hypohamiltonian graphs. Networks 8 (3) (1978)
Seifollah Louis Hakimi, Edward F. Schmeichel
On the connectivity of maximal planar graphs. J. Graph Theory 2 (4) (1978)
J. B. Collier, Edward F. Schmeichel
New flip-flop construction for hypohamilton graphs. Discret. Math. 18 (3) (1977)