Sheng Bau

Email: s.bau@sms.edu.pk

Course: Graph Theory and Combinatorics

Publications

1. R.E.L. Aldred, S. Bau and D.A. Holton: Primitive graphs, Ars Combinatoria, 23(B)(1987), 183-193.
2. R.E.L. Aldred, S. Bau, D.A. Holton and G.F. Royle: An 11-vertex theorem for 3-connected cubic
graphs, Journal of Graph Theory, 12(4)(1988), 561-570.
3. S. Bau and D.A. Holton: On cycles containing a set of eight vertices and an edge in 3-connected
cubic graphs, Ars Combinatoria, 26(A)(1988), 21-34.
4. S. Bau and D.A. Holton: Cyclesinregular graphs, Ars Combinatoria, 29(B)(1990), 175-183.
5. S. Bau: Cycles containing a set of elements in cubic graphs, Australasian Journal of Combinatorics,
2(1990), 57-76.
6. S. Bau and D.A.Holton: Cycles containing12 verticesin 3-connected cubic graphs, Journal of
Graph Theory, 15(4)(1991), 421-429.
7. S. Bau: Cycles in cubic graphs (Abstract of PhD thesis), Bulletin of the Australian Mathematical
Society, 45(1992), 349-350.
8. S. Bau, D.A. Holton and K-M. Zhang: On generalized vertex-pancyclic graphs, Chinese Journal of
Mathematics (Taiwan), 21(1)(1993), 91-98.
9. S. Bau and J-R. Liu: Abrief discussion about the effect of information on the modern
Economy (Chinese with Chinese abstract), Journal of the Inner Mongolia Institute of Finance and
Economics 1(1994), 80-83.
10. S. Bau: Cycles containing six vertices and two edges in3-connected cubic planar graphs, 11(2), Pure and Applied Mathematics. 100-104.
11. Ayongga and S. Bau: Cycles containinga large subsetofa setof verticesin cubic graphs, Journal of the Inner Mongolia Normal University, 3(1995), 6-10.
12. S. Bau and H-R.Wang:Search for snarks (Chinese with English abstract), Teaching and Study of
Natural Sciences and Fundamental Sciences, Chengdu University of Technology Press (1996),
167-168.
13. S. Bau and H-R. Wang: Primitive graphs and cyclability of cubic graphs, Mathematical Studies,
29(2)(1996), 5-11.
14. S. Bau, G-M. Du and Z-S. Liu: Some simple properties of hypercubes (Chinese with Chinese
abstract), Journal of the Hohhot College of Education,Vol. 3-4 (1997), 46-47.
15. S. Bau, L.W. Beineke and R.C.Vandell: Decycling snakes, Congressus Numerantium, 134(1998),
79-87.
16. S. Bau: Knowledge-based economy and the primary production force (Chinese with Chinese
abstract), The Journal of the Inner Mongolia Institute of Finance and Economics, 4(1999),
35-46.
17. 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.
18. R.E.L. Aldred, S. Bau, D.A. Holton and B.D. McKay: Nonhamiltonian 3-connected cubic planar
graphs, SIAM Journal of Discrete Mathematics, 13(1)(2000), 25-32
19. S. Bau: The connectivity of matching transformation graphs of cubic bipartite plane graphs, Ars
Combinatoria, 60(2001), 161-169.
20. S. Bau, L. Beineke, G.Du, Z.Liu and R.Vandell: Decycling cubes and grids, Utilitas Mathematica,
59(2001), 129-137.
21. S. Bau: Cycles with prescribed and forbidden sets of elements in cubic graphs, Graphs and
Combinatorics 18(2002), 201-208.
22. S. Bau: Examples of pancyclic regular graphs, Bulletin of the Institute of Combinatorics and Its
Applications 34(2002), 39-44.
23. S. Bau and L.W. Beineke: The decycling numbers of graphs, Australasian Journal of
Combinatorics 25(2002), 285-298.
24. S. Bau, N.C.Wormald and S-M. Zhou: Decycling numbers of random regular graphs, Random
Structures and Algorithms 21(2002), 397-413.
25. S. Bau, M. Li, L. Liu and Z-F. Zhang: On the equitable adjacent strong edge chromatic number of
P2 x Cn, Mathematics in Economics 19(3)(2002), 15-18.
26. S. Bau and M.A. Henning: The matching transformation graphs of cubic bipartite plane graphs,
Discrete Mathematics, 262(2003), 27-36.
27. S. Bau, P. Dankelmann and M.A. Henning: Average lower independence in trees and outerplanar
graphs, Ars Combin., 69(2003), 147-159.
28. R. Anstee,Ayongga, S. Bau: Cycles containing large subsets of a specified set in cubic graphs, Bull.
Inst. Combin. Appl., 39(2003), 79-84.
29. C-K. Lin, H-M. Huang, L-H. Hsu and S. Bau: Mutually independent hamiltonian paths in
Star networks, Networks, 42(2)(2005), 110-117.
30. S. Bau and A. Saito: Reduction for 3-connected graphs of minimum degree at least Four,
Submitted to Graphs and Combinatorics.