Douglas Bauer

2008
27		Douglas Bauer, Nathan Kahl, Linda E. McGuire, Edward F. Schmeichel: Long Cycles in 2-Connected Triangle-Free Graphs. Ars Comb. 86: (2008)
2007
26		Douglas Bauer, Edward F. Schmeichel, T. Surowiec: Subdivision of Edges and Matching Size. Ars Comb. 84: (2007)
25	EE	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)
24	EE	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
23	EE	Douglas Bauer, Hajo Broersma, Edward F. Schmeichel: Toughness in Graphs - A Survey. Graphs and Combinatorics 22(1): 1-35 (2006)
2004
22	EE	Douglas Bauer, T. Niessen, Edward F. Schmeichel: Toughness, minimum degree, and spanning cubic subgraphs. Journal of Graph Theory 45(2): 119-141 (2004)
21	EE	Douglas Bauer, T. Niessen, Edward F. Schmeichel: Toughness, minimum degree, and spanning cubic subgraphs. Journal of Graph Theory 46(2): 144 (2004)
2002
20		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)
19	EE	Douglas Bauer, Hajo Broersma, Edward F. Schmeichel: More Progress on Tough Graphs - The Y2K Report. Electronic Notes in Discrete Mathematics 11: 63-80 (2002)
2000
18	EE	Douglas Bauer, Hajo Broersma, Henk Jan Veldman: Not Every 2-tough Graph Is Hamiltonian. Discrete Applied Mathematics 99(1-3): 317-321 (2000)
17	EE	Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman: Chordality and 2-factors in Tough Graphs. Discrete Applied Mathematics 99(1-3): 323-329 (2000)
16	EE	Douglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman: Long cycles in 3-cyclable graphs. Discrete Mathematics 218(1-3): 1-8 (2000)
1997
15	EE	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)
1996
14	EE	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
13	EE	Douglas Bauer, H. J. Broersma, J. van den Heuvel, Henk Jan Veldman: Long cycles in graphs with prescribed toughness and minimum degree. Discrete Mathematics 141(1-3): 1-10 (1995)
12	EE	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
11	EE	Douglas Bauer, Aurora Morgana, Edward F. Schmeichel: On the complexity of recognizing tough graphs. Discrete Mathematics 124(1-3): 13-17 (1994)
1991
10	EE	Douglas Bauer, Genghua Fan, Henk Jan Veldman: Hamiltonian properties of graphs with large neighborhood unions. Discrete Mathematics 96(1): 33-49 (1991)
1990
9	EE	Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel: Recognizing tough graphs is NP-hard. Discrete Applied Mathematics 28(3): 191-195 (1990)
8	EE	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)
7	EE	Douglas Bauer, Aurora Morgana, Edward F. Schmeichel: A simple proof of a theorem of Jung. Discrete Mathematics 79(2): 147-152 (1990)
6	EE	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
5	EE	Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao: A generalization of a result of Häggkvist and Nicoghossian. J. Comb. Theory, Ser. B 47(2): 237-243 (1989)
1984
4	EE	Douglas Bauer: Extremal non-bipartite regular graphs of girth 4. J. Comb. Theory, Ser. B 37(1): 64-69 (1984)
1983
3	EE	Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel: Domination alteration sets in graphs. Discrete Mathematics 47: 153-161 (1983)
2	EE	Douglas Bauer: Regular Kn-free graphs. J. Comb. Theory, Ser. B 35(2): 193-200 (1983)
1982
1	EE	Douglas Bauer, Ralph Tindell: Graphs isomorphic to subgraphs of their line-graphs. Discrete Mathematics 41(1): 1-6 (1982)

Coauthor Index

1	Hajo Broersma (H. J. Broersma)	[5] [13] [18] [19] [20] [23] [24] [25]
2	Genghua Fan	[10]
3	S. Louis Hakimi	[9]
4	Frank Harary	[3]
5	J. van den Heuvel	[13]
6	Willem-Jan van den Heuvel	[12] [15]
7	Nathan Kahl	[25] [27]
8	Gyula Y. Katona	[17]
9	Dieter Kratsch	[17]
10	Linda E. McGuire	[16] [27]
11	Aurora Morgana	[7] [8] [11] [15] [20] [24] [25]
12	Juhani Nieminen	[3]
13	T. Niessen	[21] [22]
14	Li Rao	[5]
15	Edward F. Schmeichel	[6] [7] [8] [9] [11] [12] [14] [15] [19] [20] [21] [22] [23] [24] [25] [26] [27]
16	Charles L. Suffel	[3]
17	T. Surowiec	[25] [26]
18	Ralph Tindell	[1]
19	Huib Trommel	[16]
20	Henk Jan Veldman	[5] [8] [10] [13] [14] [16] [17] [18]

Colors in the list of coauthors