Edward F. Schmeichel

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