default search action
Edward F. Schmeichel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j71]Douglas Bauer
, Linda M. Lesniak
A generalization of a theorem of Nash-Williams. Graphs Comb. 38(6): 184 (2022) - 2020
- [j70]Douglas Bauer
On the necessity of Chvátal's Hamiltonian degree condition. AKCE Int. J. Graphs Comb. 17(2): 665-669 (2020)
2010 – 2019
- 2017
- [j69]Douglas Bauer
Best Monotone Degree Condition for the Hamiltonicity of Graphs with a 2-Factor. Graphs Comb. 33(5): 1231-1248 (2017) - 2016
- [j68]Douglas Bauer
Vertex Arboricity and Vertex Degrees. Graphs Comb. 32(5): 1699-1705 (2016) - 2015
- [j67]Douglas Bauer
Best monotone degree conditions for binding number and cycle structure. Discret. Appl. Math. 195: 8-17 (2015) - [j66]Douglas Bauer
Best Monotone Degree Conditions for Graph Properties: A Survey. Graphs Comb. 31(1): 1-22 (2015) - 2014
- [j65]Douglas Bauer
Toughness and binding number. Discret. Appl. Math. 165: 60-68 (2014) - 2013
- [j64]Douglas Bauer
Toughness and Vertex Degrees. J. Graph Theory 72(2): 209-219 (2013) - 2012
- [j63]Douglas Bauer
Degree Sequences and the Existence of k-Factors. Graphs Comb. 28(2): 149-166 (2012) - [j62]Douglas Bauer
Binding Number, Minimum Degree, and Cycle Structure in Graphs. J. Graph Theory 71(2): 219-228 (2012) - 2011
- [j61]Douglas Bauer
Best monotone degree conditions for binding number. Discret. Math. 311(18-19): 2037-2043 (2011)
2000 – 2009
- 2009
- [j60]Douglas Bauer
Sufficient degree conditions for k-edge-connectedness of a graph. Networks 54(2): 95-98 (2009) - 2008
- [j59]Douglas Bauer, Nathan Kahl, Linda E. McGuire, Edward F. Schmeichel:
Long Cycles in 2-Connected Triangle-Free Graphs. Ars Comb. 86 (2008) - 2007
- [j58]Douglas Bauer, Edward F. Schmeichel, Thomas M. Surowiec:
Subdivision of Edges and Matching Size. Ars Comb. 84 (2007) - [j57]Douglas Bauer
Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discret. Appl. Math. 155(10): 1336-1343 (2007) - [j56]Douglas Bauer
Tutte sets in graphs I: Maximal tutte sets and D-graphs. J. Graph Theory 55(4): 343-358 (2007) - 2006
- [j55]Douglas Bauer
Toughness in Graphs - A Survey. Graphs Comb. 22(1): 1-35 (2006) - 2004
- [j54]Douglas Bauer
Toughness, minimum degree, and spanning cubic subgraphs. J. Graph Theory 45(2): 119-141 (2004) - [j53]Douglas Bauer
Toughness, minimum degree, and spanning cubic subgraphs. J. Graph Theory 46(2): 144 (2004) - [j52]S. Louis Hakimi, Edward F. Schmeichel:
Improved bounds for the chromatic number of a graph. J. Graph Theory 47(3): 217-225 (2004) - 2003
- [j51]William C. Coffman, S. Louis Hakimi, Edward F. Schmeichel:
Bounds for the chromatic number of graphs with partial information. Discret. Math. 263(1-3): 47-59 (2003) - 2002
- [j50]Douglas Bauer
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discret. Appl. Math. 120(1-3): 13-23 (2002) - [j49]Douglas Bauer
More Progress on Tough Graphs - The Y2K Report. Electron. Notes Discret. Math. 11: 63-80 (2002) - [j48]John Mitchem, Edward F. Schmeichel:
The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees. Electron. Notes Discret. Math. 11: 491-502 (2002) - [i1]S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young:
Orienting Graphs to Optimize Reachability. CoRR cs.DS/0205042 (2002) - 2000
- [j47]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): 179 (2000) - [j46]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): 278-279 (2000)
1990 – 1999
- 1999
- [j45]S. Louis Hakimi, Edward F. Schmeichel:
Improved bounds for the chromatic index of graphs and multigraphs. J. Graph Theory 32(4): 311-326 (1999) - [j44]S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel:
Locations on time-varying networks. Networks 34(4): 250-257 (1999) - 1998
- [j43]E. Gocka, Walter W. Kirchherr, Edward F. Schmeichel:
A Note on the Road-Coloring Conjecture. Ars Comb. 49 (1998) - [j42]S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Short Proofs of Theorems of Nash-Williams and Tutte. Ars Comb. 50 (1998) - 1997
- [j41]Douglas Bauer, Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel:
The Complexity of Recognizing Tough Cubic Graphs. Discret. Appl. Math. 79(1-3): 35-44 (1997) - [j40]John Mitchem, Patrick Morriss, Edward F. Schmeichel:
On the cost chromatic number of outerplanar, planar, and line graphs. Discuss. Math. Graph Theory 17(2): 229-241 (1997) - [j39]S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
Orienting Graphs to Optimize Reachability. Inf. Process. Lett. 63(5): 229-235 (1997) - [j38]S. Louis Hakimi, Edward F. Schmeichel:
Locating replicas of a database on a network. Networks 30(1): 31-36 (1997) - 1996
- [j37]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Gossiping with Multiple Sends and Receives. Discret. Appl. Math. 64(2): 105-116 (1996) - [j36]S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Star arboricity of graphs. Discret. Math. 149(1-3): 93-98 (1996) - [j35]Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman:
A note on dominating cycles in 2-connected graphs. Discret. Math. 155(1-3): 13-18 (1996) - [j34]Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel:
2-factors in triangle-free graphs. J. Graph Theory 21(4): 405-412 (1996) - [j33]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): 205 (1996) - 1995
- [j32]Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel:
Toughness and Triangle-Free Graphs. J. Comb. Theory B 65(2): 208-221 (1995) - [j31]S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Degree-bounded coloring of graphs: Variations on a theme by brooks. J. Graph Theory 20(2): 177-194 (1995) - 1994
- [j30]Douglas Bauer
On the complexity of recognizing tough graphs. Discret. Math. 124(1-3): 13-17 (1994) - [j29]Douglas Bauer, Edward F. Schmeichel:
Toughness, minimum degree, and the existence of 2-factors. J. Graph Theory 18(3): 241-256 (1994) - [j28]Martine Labbé
Approximation algorithms for the capacitated plant allocation problem. Oper. Res. Lett. 15(3): 115-126 (1994) - [j27]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Parallel Information Dissemination by Packets. SIAM J. Comput. 23(2): 355-372 (1994) - [c3]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Gossiping with Multiple Sends and Receives. IPPS 1994: 757-761 - 1993
- [j26]S. Louis Hakimi, Edward F. Schmeichel, Martine Labbé
On locating path- or tree-shaped facilities on networks. Networks 23(6): 543-555 (1993) - [j25]S. Ueno, Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel:
On Minimum Fault-Tolerant Networks. SIAM J. Discret. Math. 6(4): 565-574 (1993) - [j24]Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel:
Gossigping in a Distributed Network. IEEE Trans. Computers 42(2): 253-256 (1993) - 1992
- [j23]S. Louis Hakimi, Martine Labbé
The Voronoi Partition of a Network and Its Implications in Location Theory. INFORMS J. Comput. 4(4): 412-417 (1992) - [j22]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Sequential information dissemination by packets. Networks 22(4): 317-333 (1992) - 1991
- [j21]S. Louis Hakimi, Edward F. Schmeichel:
Fitting polygonal functions to a set of points in the plane. CVGIP Graph. Model. Image Process. 53(2): 132-136 (1991) - [j20]Sin-Min Lee, Edward F. Schmeichel, Sze-Chin Shee:
On felicitous graphs. Discret. Math. 93(2-3): 201-209 (1991) - [c2]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Parallel algorithms for information dissemination by packets. SPDP 1991: 274-281 - 1990
- [j19]Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel:
Recognizing tough graphs is NP-hard. Discret. Appl. Math. 28(3): 191-195 (1990) - [j18]Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel:
Long cycles in graphs with large degree sums. Discret. Math. 79(1): 59-70 (1990) - [j17]Douglas Bauer, Aurora Morgana, Edward F. Schmeichel:
A simple proof of a theorem of Jung. Discret. Math. 79(2): 147-152 (1990) - [j16]Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Parallel Algorithms for Gossiping by Mail. Inf. Process. Lett. 34(4): 197-202 (1990) - [j15]Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan:
A Parallel Fault Identification Algorithm. J. Algorithms 11(2): 231-241 (1990) - [j14]Douglas Bauer, Edward F. Schmeichel:
Hamiltonian degree conditions which imply a graph is pancyclic. J. Comb. Theory B 48(1): 111-116 (1990)
1980 – 1989
- 1989
- [j13]S. Louis Hakimi, Edward F. Schmeichel:
A Note on the Vertex Arboricity of a Graph. SIAM J. Discret. Math. 2(1): 64-67 (1989) - 1988
- [j12]Edward F. Schmeichel, S. Louis Hakimi:
A cycle structure theorem for hamiltonian graphs. J. Comb. Theory B 45(1): 99-107 (1988) - [j11]S. Louis Hakimi, Edward F. Schmeichel:
Chromatic factorizations of a graph. J. Graph Theory 12(2): 177-182 (1988) - [c1]Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan:
On minimizing testing rounds for fault identification. FTCS 1988: 266-271 - 1984
- [j10]S. Louis Hakimi, Edward F. Schmeichel:
An Adaptive Algorithm for System Level Diagnosis. J. Algorithms 5(4): 526-530 (1984) - 1982
- [j9]Arthur M. Hobbs, Edward F. Schmeichel:
On the maximum number of independent edges in cubic graphs. Discret. Math. 42(2-3): 317-320 (1982) - [j8]Edward F. Schmeichel, John Mitchem:
Bipartite graphs with cycles of all even lengths. J. Graph Theory 6(4): 429-439 (1982) - 1981
- [j7]Edward F. Schmeichel:
The basis number of a graph. J. Comb. Theory B 30(2): 123-129 (1981)
1970 – 1979
- 1979
- [j6]Edward F. Schmeichel, Gary S. Bloom:
Connectivity, genus, and the number of components in vertex-deleted subgraphs. J. Comb. Theory B 27(2): 198-201 (1979) - [j5]Seifollah Louis Hakimi, Edward F. Schmeichel:
On the number of cycles of length k in a maximal planar graph. J. Graph Theory 3(1): 69-86 (1979) - [j4]Seifollah Louis Hakimi, Edward F. Schmeichel, Carsten Thomassen:
On the number of hamiltonian cycles in a maximal planar graph. J. Graph Theory 3(4): 365-370 (1979) - 1978
- [j3]Seifollah Louis Hakimi, Edward F. Schmeichel:
On the connectivity of maximal planar graphs. J. Graph Theory 2(4): 307-314 (1978) - [j2]J. B. Collier, Edward F. Schmeichel:
Systematic searches for hypohamiltonian graphs. Networks 8(3): 193-200 (1978) - 1977
- [j1]J. B. Collier, Edward F. Schmeichel:
New flip-flop construction for hypohamilton graphs. Discret. Math. 18(3): 265-271 (1977)
Coauthor Index
aka: Seifollah Louis Hakimi
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-26 20:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: