Author Publications

2013

Bauer, D. and Broersma, H.J. and Heuvel van den, J. and Kahl, N. and Schmeichel, E. (2013) Toughness and vertex degrees. Journal of graph theory, 72 (2). pp. 209-219. ISSN 0364-9024

2012

Bauer, D. and Broersma, H.J. and Heuvel van den, J. and Kahl, N. and Schmeichel, E. (2012) Degree sequences and the existence of k-factors. Graphs and combinatorics, 28 (2). pp. 149-166. ISSN 0911-0119

2007

Bauer, D. and Broersma, H.J. and Kahl, N. and Morgana, A. and Schmeichel, E. and Surowiec, T. (2007) Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discrete Applied Mathematics, 155 (10). pp. 1336-1343. ISSN 0166-218X

Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E. (2007) Tutte sets in graphs I: Maximal tutte sets and D-graphs. Journal of Graph Theory, 55 (4). pp. 343-358. ISSN 0364-9024

2006

Bauer, Douglas and Broersma, Hajo and Schmeichel, Edward (2006) Toughness in graphs - A survey. Graphs and Combinatorics, 22 (1). pp. 1-35. ISSN 0911-0119

2002

Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E. (2002) Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discrete Applied Mathematics, 120 (1-3). pp. 13-23. ISSN 0166-218X

Bauer, Doug and Broersma, Hajo and Schmeichel, Edward (2002) More Progress on Tough Graphs - The Y2K Report. Electronic Notes in Discrete Mathematics, 11 . pp. 63-80. ISSN 1571-0653

2000

Bauer, D. and Broersma, H.J. and Schmeichel, E. (2000) More progress on tough graphs - The Y2K report. [Report]

Bauer, D. and Broersma, H.J. and Veldman, H.J. (2000) Not every 2-tough graph is Hamiltonian. Discrete Applied Mathematics, 99 (1-3). pp. 317-321. ISSN 0166-218X

Bauer, D. and Katona, G.Y. and Kratsch, D. and Veldman, H.J. (2000) Chordality and 2-factors in tough graphs. Discrete Mathematics, 99 (1-3). pp. 323-329. ISSN 0012-365X

Bauer, D. and McGuire, L. and Trommel, H. and Veldman, H.J. (2000) Long cycles in 3-cyclable graphs. Discrete Mathematics, 218 (1-3). pp. 1-8. ISSN 0012-365X

1999

Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E. (1999) Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion. [Report]

1996

Bauer, D. and Schmeichel, E. and Veldman, H.J. (1996) A note on dominating cycles in 2-connected graphs. Discrete Mathematics, 155 (1-3). pp. 13-18. ISSN 0012-365X

1995

Bauer, D. and Heuvel van den, J. and Schmeichel, E. (1995) Toughness and Triangle-Free Graphs. Journal of Combinatorial Theory, Series B, 65 (2). pp. 208-221. ISSN 0021-9800

Bauer, Douglas and Broersma, H.J. and Heuvel van den, J. and Veldman, H.J. (1995) Long cycles in graphs with prescribed toughness and minimum degree. Discrete Mathematics, 141 (1-3). pp. 1-10. ISSN 0012-365X

1991

Bauer, Douglas and Fan, Genghua and Veldman, Henk Jan (1991) Hamiltonian properties of graphs with large neighborhood unions. Discrete Mathematics, 96 (1). pp. 33-49. ISSN 0012-365X

1990

Bauer, Douglas and Veldman, H.J. and Morgana, A. and Schmeichel, E.F. (1990) Long cycles in graphs with large degree sums. Discrete Mathematics, 79 (1). pp. 59-70. ISSN 0012-365X

1989

Bauer, Douglas and Broersma, H.J. and Veldman, H.J. and Rao, Li (1989) A generalization of a result of Häggkvist and Nicoghossian. Journal of Combinatorial Theory, Series B, 47 (2). pp. 237-243. ISSN 0021-9800