Dr. Guo-Hui Zhang Associate Professor, Mathematical Sciences Department Classes Taught MA 244 - Intro to Linear Algebra MA 442 - Algebraic Structures w/ Applic MA 452 - Intro to Real Analysis MA 502 - Intro to Real Analysis MA 699 - Master's Thesis MA 799 - Doctoral Dissertation Publications Boolean ring and Boolean algebra, Research Report, Northeast Normal University, Changchun, China, 1983. (with W.D. Wallis) On the clique partition number of the complement of a triangle, Congressus Numerantium 66(1988), 217-226. (with W.D. Wallis) The impossibility of certain critical graphs, Recent Studies in Graph Theory, ed. V.R. Kulli, Visheva International Publications, 1989, 225-227. (with W.D. Wallis) On maximal clique irreducible graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, 8(1990), 187-193. Smallest regular graphs with prescribed odd girth, Journal of Graph Theory, 15(1991), 453-467. (with W.D. Wallis) Small clique coloring numbers, Bulletin of the Institute of Combinatorics and its Applications, 5(1992), 107-111. The maximum valency of regular graphs with given order and odd girth, Journal of Graph Theory, 16(1992), 205-211. Pseudo-one-factorizations of regular graphs of odd order-I: Some general questions, Graphs, Matrices, and Designs, ed. Rolf Rees, Marcel Dekker, 1992, 299-314. (with W.D. Wallis) On the partition and coloring of a graph by cliques, Discrete Mathematics, 120(1993), 191-203. (with W.D. Wallis and J.L. Yucas) Single-change covering designs, Designs, Codes, and Cryptography, 3(1992), 9-19. Pseudo-one-factorizations of regular graphs of odd order-II: Products of graphs, Discrete Mathematics, 128(1994), 371-384. Extremal regular graphs with prescribed odd girth, Journal of Combinatorial Theory, Series B, 60(1994), 222-238. On the iteration of graph labelings, Ars Combinatoria, 37(1994), 75-85. Some new bounds on single-change covering designs, SIAM J. Discrete Mathematics, 7(1994), 166-171. (with D.R. Preece, R.L. Constable, J.L. Yucas, W.D. Wallis, J. P. McSorley and N.C.K. Phillips) Tight single-change covering designs, Utilitas Mathematica, 47(1995), 55-84. (with A. Amin, L. Clark, J . McSorley, and H. Wang) A generalized coloring of graphs, JCMCC 24 (1997), 49-63. Inseparable orthogonal matrices over Z(2), Journal of Combinatorial Theory, Series A, 84(1998), 111-132. (with P. M. Gibson) Combinatorially orthogonal matrices and related graphs, Linear Algebra and its Applications, 282(1998), 83-95. (with P. M. Gibson) Column orthogonal (0, 1, -1)-matrices, Linear and Multilinear Algebra, 45(1999), 291-316. (with Ashok Amin and Peter Slater) Parity dimension for graphs-a linear algebraic approach, Linear and Multilinear Algebra, 50(2002), 327-342. On a conjecture of Sheehan concerning extremal regular graphs of diameter 2, Journal of Graph Theory (accepted). On the characterization of eccentric digraphs, Discrete Mathematics (accepted). A failed generalization of t-designs and its applications, submitted to the Journal of Combinatorial Designs. Ear-decompositions of (1, 2) – extendable graphs, Journal of Graph Theory (accepted). Generalizations of Sperner systems, submitted to SIAM Journal of Discrete Mathematics. On the closed-neighborhood coloring of graphs, Journal of Graph Theory (accepted). Minimal group divisible designs, submitted to Utilitas Mathematica. Factoring graphs by spanning trees, submitted to Utilitas Mathematica. Cut in graphs and domination in their inflated graphs, submitted to Journal of Graph Theory. Some new bounds on (6, g)-cages, submitted to Discrete Mathematics. On realizable sequences, submitted to JCMCC. Edge partitions of graphs by trees, submitted to SIAM J Discrete Mathematics. Gallai’s path decomposition conjecture, submitted to Discrete Mathematics. Latin squares without transversals, Submitted to Bulletin of the ICA. On a conjecture of N. Dean concerning path and cycle decompositions of graphs, submitted to Journal of Combinatorial Theory, Series B. On (k, λ)-edge-regular graphs of order 3(k – λ), submitted to European Journal of Combinatorics.