DOUGLAS BAUER Professor Mathematical Sciences Department ...

40. D. Bauer, A report on some short proofs of an Ore type theorem,
Congr. Numer. 64 (1988) 55 - 57.
41. D. Bauer and E. Schmeichel, A proof of an extension of Ore’s theorem,
Ars Combinatoria 24B (1987) 93 - 99.
42. D. Bauer, F. Boesch, C. Suffel and R. Van Slyke, On the validity
of a reduction of reliable network design to a graph extremal problem,
IEEE Transactions on Circuits and Systems, Vol. Cas-34, no 12,
(1987) 1579 - 1581.
43. D. Bauer, A note on degree conditions for hamiltonian cycles in line
graphs, Congr. Numer. 49 (1985) 11 - 18.
44. D. Bauer, F. Boesch, C. Suffel and R. Tindell, Combinatorial optimization
problems in the design of probabilistic networks. NETWORKS,
15 (1985) 257 - 271.
45. D. Bauer, Extremal non-bipartite regular graphs of girth 4, J. Combinat.
Theory - Ser.B, 37 no 1 (1984) 64 - 69.
46. D. Bauer, G. Bloom and F. Boesch, Edge to point degree lists and
extremal triangle-free point degree regular graphs. In J. Adrian Bondy
and U. S. R. Murty, editors, Progress in Graph Theory (1984) 93 - 103.
47. D. Bauer, Regular Kn-free graphs, J. Combinat. Theory - Ser.B, 35
no 2 (1983) 193 - 200.
48. D. Bauer, F. Harary, F. Nieminen and C. Suffel, Domination alteration
sets in graphs, Discrete Math., 47 (1983) 153 - 161.
49. D. Bauer and R. Tindell, The connectivities of the middle graph, J.
Combin. Inform. System Sci., 7 (1982) 54 - 55.
50. D. Bauer and R. Tindell, Graphs isomorphic to subgraphs of their line
graphs, Discrete Math., 41 (1982) 1 - 6.
51. D. Bauer and R. Tindell, The connectivities of line and total graphs,
J. Graph Theory, 6 (1982) 197 - 203.
52. D. Bauer, F. Boesch, C. Suffel and R. Tindell, Connectivity extremal
problems and the design of reliable probabilistic networks, In Gary
Chartrand, et. al., The Theory of Applications of Graphs: Proceedings