Edward F. Schmeichel

According to our database1, Edward F. Schmeichel authored at least 72 papers between 1977 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


A generalization of a theorem of Nash-Williams.
Graphs Comb., 2022

On the necessity of Chvátal's Hamiltonian degree condition.
AKCE Int. J. Graphs Comb., 2020

Best Monotone Degree Condition for the Hamiltonicity of Graphs with a 2-Factor.
Graphs Comb., 2017

Vertex Arboricity and Vertex Degrees.
Graphs Comb., 2016

Best Monotone Degree Conditions for Graph Properties: A Survey.
Graphs Comb., 2015

Best monotone degree conditions for binding number and cycle structure.
Discret. Appl. Math., 2015

Toughness and binding number.
Discret. Appl. Math., 2014

Toughness and Vertex Degrees.
J. Graph Theory, 2013

Binding Number, Minimum Degree, and Cycle Structure in Graphs.
J. Graph Theory, 2012

Degree Sequences and the Existence of k-Factors.
Graphs Comb., 2012

Best monotone degree conditions for binding number.
Discret. Math., 2011

Sufficient degree conditions for <i>k</i>-edge-connectedness of a graph.
Networks, 2009

Long Cycles in 2-Connected Triangle-Free Graphs.
Ars Comb., 2008

Tutte sets in graphs I: Maximal tutte sets and D-graphs.
J. Graph Theory, 2007

Tutte sets in graphs II: The complexity of finding maximum Tutte sets.
Discret. Appl. Math., 2007

Subdivision of Edges and Matching Size.
Ars Comb., 2007

Toughness in Graphs - A Survey.
Graphs Comb., 2006

Improved bounds for the chromatic number of a graph.
J. Graph Theory, 2004

Toughness, minimum degree, and spanning cubic subgraphs.
J. Graph Theory, 2004

Bounds for the chromatic number of graphs with partial information.
Discret. Math., 2003

The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees.
Electron. Notes Discret. Math., 2002

More Progress on Tough Graphs - The Y2K Report.
Electron. Notes Discret. Math., 2002

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion.
Discret. Appl. Math., 2002

Tiling Rectangles with Trominoes: 10641.
Am. Math. Mon., 2000

An Identity Involving Derangements: 10643.
Am. Math. Mon., 2000

Locations on time-varying networks.
Networks, 1999

Improved bounds for the chromatic index of graphs and multigraphs.
J. Graph Theory, 1999

Short Proofs of Theorems of Nash-Williams and Tutte.
Ars Comb., 1998

A Note on the Road-Coloring Conjecture.
Ars Comb., 1998

Locating replicas of a database on a network.
Networks, 1997

Orienting Graphs to Optimize Reachability.
Inf. Process. Lett., 1997

On the cost chromatic number of outerplanar, planar, and line graphs.
Discuss. Math. Graph Theory, 1997

The Complexity of Recognizing Tough Cubic Graphs.
Discret. Appl. Math., 1997

Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126].
Oper. Res. Lett., 1996

2-factors in triangle-free graphs.
J. Graph Theory, 1996

Star arboricity of graphs.
Discret. Math., 1996

A note on dominating cycles in 2-connected graphs.
Discret. Math., 1996

Gossiping with Multiple Sends and Receives.
Discret. Appl. Math., 1996

Degree-bounded coloring of graphs: Variations on a theme by brooks.
J. Graph Theory, 1995

Toughness and Triangle-Free Graphs.
J. Comb. Theory B, 1995

Parallel Information Dissemination by Packets.
SIAM J. Comput., 1994

Approximation algorithms for the capacitated plant allocation problem.
Oper. Res. Lett., 1994

Toughness, minimum degree, and the existence of 2-factors.
J. Graph Theory, 1994

On the complexity of recognizing tough graphs.
Discret. Math., 1994

Gossigping in a Distributed Network.
IEEE Trans. Computers, 1993

On Minimum Fault-Tolerant Networks.
SIAM J. Discret. Math., 1993

On locating path- or tree-shaped facilities on networks.
Networks, 1993

Sequential information dissemination by packets.
Networks, 1992

The Voronoi Partition of a Network and Its Implications in Location Theory.
INFORMS J. Comput., 1992

On felicitous graphs.
Discret. Math., 1991

Fitting polygonal functions to a set of points in the plane.
CVGIP Graph. Model. Image Process., 1991

Parallel algorithms for information dissemination by packets.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Hamiltonian degree conditions which imply a graph is pancyclic.
J. Comb. Theory B, 1990

A Parallel Fault Identification Algorithm.
J. Algorithms, 1990

Parallel Algorithms for Gossiping by Mail.
Inf. Process. Lett., 1990

Long cycles in graphs with large degree sums.
Discret. Math., 1990

A simple proof of a theorem of Jung.
Discret. Math., 1990

Recognizing tough graphs is NP-hard.
Discret. Appl. Math., 1990

A Note on the Vertex Arboricity of a Graph.
SIAM J. Discret. Math., 1989

Chromatic factorizations of a graph.
J. Graph Theory, 1988

A cycle structure theorem for hamiltonian graphs.
J. Comb. Theory B, 1988

On minimizing testing rounds for fault identification.
Proceedings of the Eighteenth International Symposium on Fault-Tolerant Computing, 1988

An Adaptive Algorithm for System Level Diagnosis.
J. Algorithms, 1984

Bipartite graphs with cycles of all even lengths.
J. Graph Theory, 1982

On the maximum number of independent edges in cubic graphs.
Discret. Math., 1982

The basis number of a graph.
J. Comb. Theory B, 1981

On the number of hamiltonian cycles in a maximal planar graph.
J. Graph Theory, 1979

On the number of cycles of length <i>k</i> in a maximal planar graph.
J. Graph Theory, 1979

Connectivity, genus, and the number of components in vertex-deleted subgraphs.
J. Comb. Theory B, 1979

Systematic searches for hypohamiltonian graphs.
Networks, 1978

On the connectivity of maximal planar graphs.
J. Graph Theory, 1978

New flip-flop construction for hypohamilton graphs.
Discret. Math., 1977