E
Edward F. Schmeichel
Researcher at San Jose State University
Publications - 76
Citations - 1278
Edward F. Schmeichel is an academic researcher from San Jose State University. The author has contributed to research in topics: Graph toughness & Pancyclic graph. The author has an hindex of 20, co-authored 76 publications receiving 1195 citations.
Papers
More filters
Journal ArticleDOI
Toughness in graphs - A survey
TL;DR: This survey has attempted to bring together most of the results and papers that deal with toughness related to cycle structure into a few self explanatory categories.
Journal ArticleDOI
Recognizing tough graphs is NP-hard
TL;DR: It is proved it is NP-hard to recognize t-tough graphs for any fixed positive rational number t, thereby settling a long-standing open problem.
Journal ArticleDOI
Long cycles in graphs with large degree sums
TL;DR: If G is 2-tough and s⩾n, then G is hamiltonian and every longest cycle in G is a dominating cycle, generalizing a result of Bondy and one of Nash-Williams.
Journal ArticleDOI
On locating path‐ or tree‐shaped facilities on networks
TL;DR: The study of “optimally” locating on a network a single facility of a given total length in the form of a path or a tree was initiated by several authors and is extended to the problem of locating p (≥1) such facilities, leading to 64 problems.
Journal ArticleDOI
The Voronoi Partition of a Network and Its Implications in Location Theory
TL;DR: Two ways to measure the “size” of a territory are described and it is shown that this latter problem is NP-complete when p is part of the input, but that the problem can be solved in polynomial time for any fixed p.