DR  Sheng Bau,   LECTURER

School of Mathematics, Statistics and Information Technology, 
University of KwaZulu-Natal, Pietermaritzburg, 
Private Bag X01, Scottsville, 
Pietermaritzburg, 3209 
South Africa
Office Tel:   (27) 33 2605785

Office Fax:  (27) 33 2605648

Email: bausheng@nu.ac.za

Other Pages:http://bau.math.unp.ac.za (LAN)
http://www.geocities.com/sheng_bau/ (www)

Bau's PictureRESEARCH INTERESTS: Cycles in graphs and oriented graphs, cubic graphs with edge chromatic number 4 (snarks), pancyclicity, transformation graphs, decycling numbers of special classes of graphs, isomorphic factorization of graphs; Applications of combinatorial mathematics in economics and optimization, software design, development and evaluation, electronic publication. 

I am a member of the American Mathematical Society and of Australasian Combinatorial Mathematics Society, fellow of the Institute of Combinatorics and Its Application and a member of directorate of the Chinese Graph Theory Society. 

I am a reviewer for the American Mathematical Society.

    1. R.E.L. Aldred, S. Bau, D.A. Holton and B.D. McKay: Cycles through 23 vertices in 3-connected cubic planar graphs, Graphs and Combinatorics, 15(4)(1999), 373-376. paper3.ps
    2. S. Bau, L.W. Beineke and R.C. Vandell: Decycling snakes, Congressus Numerantium, 134(1998), 79-87.
    3. S. Bau, The connectivity of matching transformation graphs of cubic bipartite plane graphs, Ars Combinatoria 60(2001), 161-169. trans.ps
    4. S. Bau, L.W. Beineke, G. Du, Z. Liu and R.C. Vandell, Decycling cubes and grids, Utilitas Mathematica 59(2001), 129-137. deca.ps
    5. R.E.L. Aldred, S. Bau, D.A. Holton and B.D. McKay: Nonhamiltonian cubic 3-connected planar graphs, SIAM Journal on Discrete Mathematics, 13(1)(2000), 25-32 (electronic).
    6. S. Bau: Cycles with prescribed and forbidden sets of elements in cubic graphs, to appear in Graphs and Combinatoricsmresn.ps
    7. S. Bau and M.A. Henning: Matching transformation graphs of connected cubic bipartite plane graphs, to appear in Discrete Mathematicstrans2.ps
    8. S. Bau: Examples of pancyclic regular graphs, The Bulletin of The Institute of Combinatorics and Its Applications, 34(2002), 39-44.  panc.pdf
    9. S. Bau and L.W. Beineke: The decycling numbers of graphs, Australasian Journal of Combinatorics, 25(2002), 285-298.  decs.pdf



First Semester 2002: 

  • Calculus for Life Science (Math111, first year)
  • Algorithms and Complexity (Mathematics and Computer Science Honours) 

Second Semester 2001: 

  • Calculus (Math120 and Math121, first year)
  • Numerical Methods (Math 251 and Math 253) 

First Semester 2001: 

  • Discrete Mathematics (Math110 and Math112, first year)
  • Algorithms and Complexity (Applied Mathematics Honours) 

Second Semester 2000: 

  • Numerical Solutions (second year) 
  • Numerical Calculus (second year)
  • Calculus (Math120, Math121, first year)

First Semester 2000:

  • Differential Equations (third year)
  • Quantitative Methods (first year)








Curriculum Vitae

Some Screenshots

Weekly Schedules: First Semester 2002

Appointment not necessary but may be made by e-mail or phone.
Office location: F36 Science Block.

Great Links

A photographic gallery of Brendan McKay.

Home page of Gordon Royle.

Graph theory page by Daniel Sanders.


Home Staff