Edward F. Schmeichel

	2008
44		Douglas Bauer, Nathan Kahl, Linda E. McGuire, Edward F. Schmeichel: Long Cycles in 2-Connected Triangle-Free Graphs. Ars Comb. 86: (2008)
	2007
43		Douglas Bauer, Edward F. Schmeichel, T. Surowiec: Subdivision of Edges and Matching Size. Ars Comb. 84: (2007)
42		Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, T. Surowiec: Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discrete Applied Mathematics 155(10): 1336-1343 (2007)
41		Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel: Tutte sets in graphs I: Maximal tutte sets and D-graphs. Journal of Graph Theory 55(4): 343-358 (2007)
	2006
40		Douglas Bauer, Hajo Broersma, Edward F. Schmeichel: Toughness in Graphs - A Survey. Graphs and Combinatorics 22(1): 1-35 (2006)
	2004
39		Douglas Bauer, T. Niessen, Edward F. Schmeichel: Toughness, minimum degree, and spanning cubic subgraphs. Journal of Graph Theory 45(2): 119-141 (2004)
38		Douglas Bauer, T. Niessen, Edward F. Schmeichel: Toughness, minimum degree, and spanning cubic subgraphs. Journal of Graph Theory 46(2): 144 (2004)
37		S. Louis Hakimi, Edward F. Schmeichel: Improved bounds for the chromatic number of a graph. Journal of Graph Theory 47(3): 217-225 (2004)
	2003
36		William C. Coffman, S. Louis Hakimi, Edward F. Schmeichel: Bounds for the chromatic number of graphs with partial information. Discrete Mathematics 263(1-3): 47-59 (2003)
	2002
35		S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young: Orienting Graphs to Optimize Reachability CoRR cs.DS/0205042: (2002)
34		Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel: Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discrete Applied Mathematics 120(1-3): 13-23 (2002)
33		John Mitchem, Edward F. Schmeichel: The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees. Electronic Notes in Discrete Mathematics 11: 491-502 (2002)
32		Douglas Bauer, Hajo Broersma, Edward F. Schmeichel: More Progress on Tough Graphs - The Y2K Report. Electronic Notes in Discrete Mathematics 11: 63-80 (2002)
	1999
31		S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel: Locations on time-varying networks. Networks 34(4): 250-257 (1999)
	1998
30		E. Gocka, Walter W. Kirchherr, Edward F. Schmeichel: A Note on the Road-Coloring Conjecture. Ars Comb. 49: (1998)
29		S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Short Proofs of Theorems of Nash-Williams and Tutte. Ars Comb. 50: (1998)
	1997
28		Douglas Bauer, Willem-Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel: The Complexity of Recognizing Tough Cubic Graphs. Discrete Applied Mathematics 79(1-3): 35-44 (1997)
27		S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young: Orienting Graphs to Optimize Reachability. Inf. Process. Lett. 63(5): 229-235 (1997)
26		S. Louis Hakimi, Edward F. Schmeichel: Locating replicas of a database on a network. Networks 30(1): 31-36 (1997)
	1996
25		Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Gossiping with Multiple Sends and Receives. Discrete Applied Mathematics 64(2): 105-116 (1996)
24		S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Star arboricity of graphs. Discrete Mathematics 149(1-3): 93-98 (1996)
23		Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman: A note on dominating cycles in 2-connected graphs. Discrete Mathematics 155(1-3): 13-18 (1996)
	1995
22		Douglas Bauer, Willem-Jan van den Heuvel, Edward F. Schmeichel: Toughness and Triangle-Free Graphs. J. Comb. Theory, Ser. B 65(2): 208-221 (1995)
	1994
21		Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Gossiping with Multiple Sends and Receives. IPPS 1994: 757-761
20		Douglas Bauer, Aurora Morgana, Edward F. Schmeichel: On the complexity of recognizing tough graphs. Discrete Mathematics 124(1-3): 13-17 (1994)
19		Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Parallel Information Dissemination by Packets. SIAM J. Comput. 23(2): 355-372 (1994)
	1993
18		Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel: Gossigping in a Distributed Network. IEEE Trans. Computers 42(2): 253-256 (1993)
17		S. Ueno, Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel: On Minimum Fault-Tolerant Networks. SIAM J. Discrete Math. 6(4): 565-574 (1993)
	1992
16		S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel: The Voronoi Partition of a Network and Its Implications in Location Theory. INFORMS Journal on Computing 4(4): 412-417 (1992)
	1991
15		Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Parallel algorithms for information dissemination by packets. SPDP 1991: 274-281
14		S. Louis Hakimi, Edward F. Schmeichel: Fitting polygonal functions to a set of points in the plane. CVGIP: Graphical Model and Image Processing 53(2): 132-136 (1991)
13		Sin-Min Lee, Edward F. Schmeichel, S. C. Shee: On felicitous graphs. Discrete Mathematics 93(2-3): 201-209 (1991)
	1990
12		Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel: Recognizing tough graphs is NP-hard. Discrete Applied Mathematics 28(3): 191-195 (1990)
11		Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel: Long cycles in graphs with large degree sums. Discrete Mathematics 79(1): 59-70 (1990)
10		Douglas Bauer, Aurora Morgana, Edward F. Schmeichel: A simple proof of a theorem of Jung. Discrete Mathematics 79(2): 147-152 (1990)
9		Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Parallel Algorithms for Gossiping by Mail. Inf. Process. Lett. 34(4): 197-202 (1990)
8		Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, G. Sullivan: A Parallel Fault Identification Algorithm. J. Algorithms 11(2): 231-241 (1990)
7		Douglas Bauer, Edward F. Schmeichel: Hamiltonian degree conditions which imply a graph is pancyclic. J. Comb. Theory, Ser. B 48(1): 111-116 (1990)
	1989
6		S. Louis Hakimi, Edward F. Schmeichel: A Note on the Vertex Arboricity of a Graph. SIAM J. Discrete Math. 2(1): 64-67 (1989)
	1988
5		Edward F. Schmeichel, S. Louis Hakimi: A cycle structure theorem for hamiltonian graphs. J. Comb. Theory, Ser. B 45(1): 99-107 (1988)
	1984
4		S. Louis Hakimi, Edward F. Schmeichel: An Adaptive Algorithm for System Level Diagnosis. J. Algorithms 5(4): 526-530 (1984)
	1982
3		Arthur M. Hobbs, Edward F. Schmeichel: On the maximum number of independent edges in cubic graphs. Discrete Mathematics 42(2-3): 317-320 (1982)
	1981
2		Edward F. Schmeichel: The basis number of a graph. J. Comb. Theory, Ser. B 30(2): 123-129 (1981)
	1979
1		Edward F. Schmeichel, Gary S. Bloom: Connectivity, genus, and the number of components in vertex-deleted subgraphs. J. Comb. Theory, Ser. B 27(2): 198-201 (1979)

Coauthor Index

1	Anindo Bagchi	[9] [15] [17] [18] [19] [21] [25]
2	Douglas Bauer	[7] [10] [11] [12] [20] [22] [23] [28] [32] [34] [38] [39] [40] [41] [42] [43] [44]
3	Gary S. Bloom	[1]
4	Hajo Broersma (H. J. Broersma)	[32] [34] [40] [41] [42]
5	William C. Coffman	[36]
6	E. Gocka	[30]
7	S. Louis Hakimi	[4] [5] [6] [8] [9] [12] [14] [15] [16] [17] [18] [19] [21] [24] [25] [26] [27] [29] [31] [35] [36] [37]
8	Willem-Jan van den Heuvel	[22] [28]
9	Arthur M. Hobbs	[3]
10	Nathan Kahl	[42] [44]
11	Walter W. Kirchherr	[30]
12	Martine Labbé	[16] [31]
13	Sin-Min Lee	[13]
14	Linda E. McGuire	[44]
15	John Mitchem	[9] [24] [29] [33]
16	Aurora Morgana	[10] [11] [20] [28] [34] [41] [42]
17	T. Niessen	[38] [39]
18	M. Otsuka	[8]
19	S. C. Shee	[13]
20	G. Sullivan	[8]
21	T. Surowiec	[42] [43]
22	S. Ueno	[17]
23	Henk Jan Veldman	[11] [23]
24	Neal E. Young	[27] [35]

Colors in the list of coauthors