Edward F. Schmeichel

	2012
48		Douglas Bauer, H. J. Broersma, J. van den Heuvel, Nathan Kahl, Edward F. Schmeichel: Degree Sequences and the Existence of k-Factors. Graphs and Combinatorics 28(2): 149-166 (2012)
	2011
47		Douglas Bauer, M. Yatauro, Nathan Kahl, Edward F. Schmeichel: Best monotone degree conditions for binding number. Discrete Mathematics 311(18-19): 2037-2043 (2011)
	2009
46		Douglas Bauer, S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel: Sufficient degree conditions for k-edge-connectedness of a graph. Networks 54(2): 95-98 (2009)
	2008
45		Douglas Bauer, Nathan Kahl, Linda E. McGuire, Edward F. Schmeichel: Long Cycles in 2-Connected Triangle-Free Graphs. Ars Comb. 86: (2008)
	2007
44		Douglas Bauer, Edward F. Schmeichel, T. Surowiec: Subdivision of Edges and Matching Size. Ars Comb. 84: (2007)
43		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)
42		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
41		Douglas Bauer, Hajo Broersma, Edward F. Schmeichel: Toughness in Graphs - A Survey. Graphs and Combinatorics 22(1): 1-35 (2006)
	2004
40		Douglas Bauer, T. Niessen, Edward F. Schmeichel: Toughness, minimum degree, and spanning cubic subgraphs. Journal of Graph Theory 45(2): 119-141 (2004)
39		Douglas Bauer, T. Niessen, Edward F. Schmeichel: Toughness, minimum degree, and spanning cubic subgraphs. Journal of Graph Theory 46(2): 144 (2004)
38		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
37		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
36		S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young: Orienting Graphs to Optimize Reachability CoRR cs.DS/0205042: (2002)
35		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)
34		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)
33		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
32		S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel: Locations on time-varying networks. Networks 34(4): 250-257 (1999)
	1998
31		E. Gocka, Walter W. Kirchherr, Edward F. Schmeichel: A Note on the Road-Coloring Conjecture. Ars Comb. 49: (1998)
30		S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Short Proofs of Theorems of Nash-Williams and Tutte. Ars Comb. 50: (1998)
	1997
29		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)
28		S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young: Orienting Graphs to Optimize Reachability. Inf. Process. Lett. 63(5): 229-235 (1997)
27		S. Louis Hakimi, Edward F. Schmeichel: Locating replicas of a database on a network. Networks 30(1): 31-36 (1997)
	1996
26		Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Gossiping with Multiple Sends and Receives. Discrete Applied Mathematics 64(2): 105-116 (1996)
25		S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Star arboricity of graphs. Discrete Mathematics 149(1-3): 93-98 (1996)
24		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
23		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
22		Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Gossiping with Multiple Sends and Receives. IPPS 1994: 757-761
21		Douglas Bauer, Aurora Morgana, Edward F. Schmeichel: On the complexity of recognizing tough graphs. Discrete Mathematics 124(1-3): 13-17 (1994)
20		Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Parallel Information Dissemination by Packets. SIAM J. Comput. 23(2): 355-372 (1994)
	1993
19		Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel: Gossigping in a Distributed Network. IEEE Trans. Computers 42(2): 253-256 (1993)
18		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
17		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
16		Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Parallel algorithms for information dissemination by packets. SPDP 1991: 274-281
15		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)
14		Sin-Min Lee, Edward F. Schmeichel, S. C. Shee: On felicitous graphs. Discrete Mathematics 93(2-3): 201-209 (1991)
	1990
13		Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel: Recognizing tough graphs is NP-hard. Discrete Applied Mathematics 28(3): 191-195 (1990)
12		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)
11		Douglas Bauer, Aurora Morgana, Edward F. Schmeichel: A simple proof of a theorem of Jung. Discrete Mathematics 79(2): 147-152 (1990)
10		Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Parallel Algorithms for Gossiping by Mail. Inf. Process. Lett. 34(4): 197-202 (1990)
9		Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan: A Parallel Fault Identification Algorithm. J. Algorithms 11(2): 231-241 (1990)
8		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
7		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
6		Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan: On minimizing testing rounds for fault identification. FTCS 1988: 266-271
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	[10] [16] [18] [19] [20] [22] [26]
2	Douglas Bauer	[8] [11] [12] [13] [21] [23] [24] [29] [33] [35] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48]
3	Gary S. Bloom	[1]
4	Hajo Broersma (H. J. Broersma)	[33] [35] [41] [42] [43] [48]
5	William C. Coffman	[37]
6	E. Gocka	[31]
7	S. Louis Hakimi	[4] [5] [6] [7] [9] [10] [13] [15] [16] [17] [18] [19] [20] [22] [25] [26] [27] [28] [30] [32] [36] [37] [38] [46]
8	J. van den Heuvel	[48]
9	Willem-Jan van den Heuvel	[23] [29]
10	Arthur M. Hobbs	[3]
11	Nathan Kahl	[43] [45] [46] [47] [48]
12	Walter W. Kirchherr	[31]
13	Martine Labbé	[17] [32]
14	Sin-Min Lee	[14]
15	Linda E. McGuire	[45]
16	John Mitchem	[10] [25] [30] [34]
17	Aurora Morgana	[11] [12] [21] [29] [35] [42] [43]
18	T. Niessen	[39] [40]
19	M. Otsuka	[6] [9]
20	S. C. Shee	[14]
21	Geoff Sullivan	[6] [9]
22	T. Surowiec	[43] [44]
23	S. Ueno	[18]
24	Henk Jan Veldman	[12] [24]
25	M. Yatauro	[47]
26	Neal E. Young	[28] [36]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page