Research Publications

October 2010

  1. H. Wang, Disjoint 5-cycles in a graph, Discussiones Mathematicae Graph Theory, 32(2012) 221–242.

  2. H. Wang, Proof of the Erdos-Faudree Conjecture on Quadrilaterals, Graphs and Combinatorics, 26(2010), 833-877.

  3. R. Bauer and H. Wang, Disjoint triangles and pentagons in a graph. Australas. J. Combin. 46 (2010), 79–89.

  4. H. Wang, Packing two copies of a sparse graph into a graph with restrained maximum degree, Journal of Graph Theory, 62(2009), 178-187.

  5. H. Wang, Packing Three Copies of a Tree into a Complete Bipartite Graph, Annals of Combinatorics, 13(2009), 261-269.

  6. H. Wang, Disjoint triangles and quadrilaterals in a graph, Central European Journal of Mathematics, 6(2008), 543-558.

  7. H. Wang, Pentagons and cycle coverings, Journal of Graph Theory, 54(2007), 194-208.

  8. Y. Egawa, S. Fujita and K.Kawarabayashi and H. Wang, Existence of two disjoint long cycles in graphs, Discrete Mathematics, 305(2005), 154-169.

  9. H. Wang, Maximal total length of k disjoint cycles in bipartite graphs, Combinatorica, 25(3)(2005), 367--377.

  10. H. Wang, On large cycles with lengths differing by one or two, Australasian Journal of Combinatorics, 33(2005), 329--333.

  11. Danhong Zhang and Hong Wang, Disjoint quadrilaterals in Directed Graphs, Journal of Graph Theory, 50(2005), 91--104.

  12. Hong Wang, Vertex-disjoint quadrilaterals in graphs, Discrete Mathematics, 288(2004), 149--166.

  13. Danhong Zhang and Hong Wang, A minimum degree result for disjoint cycles and forests in bipartite graphs, The Australasian Journal of Combinatorics, 29(2004), 35--47.

  14. Yoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi and Hong Wang, Covering Vertices of a Graph by $k$ Disjoint Cycles, Discrete Mathematics, 270(2003), 114--124.

  15. Y. Ishigami and H. Wang, An extension of a theorem on cycles containing specified independent edges, Discrete Mathematics, 245(2002), 127--137.

  16. H. Wang, On Covering a Bipartite Graph with Cycles, SIAMS Discrete Mathematics, No.1, 15(2002), 86--96.

  17. H. Wang, Directed bipartite graphs containing every possible pair of directed cycles, ARS Combinatoria, 60 (2001), 293--306.

  18. H. Wang, On independent cycles in a bipartite graph, Graphs and Combinatorics, 17(2001), 177--183.

  19. H. Wang, On quadrilaterals and cycle covers in a bipartite graph, ARS Combinatoria, 58(2001), 301--311.

  20. H. Wang, Independent directed triangles in a directed graph, Graphs and Combinatorics, 16(2000), 453--462.

  21. H. Wang, Large disjoint cycles in a bipartite graph, Graphs and Combinatorics, 16(2000), 359--366.

  22. H. Wang, On the Maximal Number of Vertices Covered by Disjoint Cycles, The Australasian Journal of Combinatorics, 21(2000), 179--186.

  23. H. Wang, Digraphs Containing Every Possible Pair of Dicycles, Journal of Graph Theory, 34(2000), 154--162.

  24. Y. Egawa, R. Faudree, E. Gyori, Y. Ishigami, R. Schelp, and H. Wang, Vertex-disjoint cycles containing specified edges, Graphs and Combinatorics, 16(2000), 81--92.

  25. C. Little, K. Teo and H. Wang, Fusion in bipartite graphs, New Zealand Journal of Mathematics, 28(1999), 225--236.

  26. H. Wang, On Vertex-disjoint complete bipartite subgraphs in a bipartite graph, Graphs and Combinatorics, 15(1999), 353--364.

  27. H. Wang, Covering a bipartite graph with cycles passing through given edges, The Australasian Journal of Combinatorics, 19(1999), 115--121.

  28. H. Wang, Bipartite graphs containing every possible pair of cycles, Discrete Mathematics, 207(1999), 233--242.

  29. H. Wang, On the maximum number of independent cycles in a graph, Discrete Mathematics, 205(1999), 183--190.

  30. H. Wang, Proof of a conjecture on cycles in a bipartite graph, Journal of Graph Theory, 31(1999), 333-343.

  31. B. Randerath, I. Schiermeyer and H. Wang, On quadrilaterals in a graph, Discrete Mathematics, 203(1999), 229-237.

  32. H. Wang, On 2-factors of a bipartite graph, Journal of Graph Theory, 31(1999), 101-106.

  33. David M. Berman, Jiannong Liu, Hong Wang and Larry Wargo, Induced stars in trees, The Australasian Journal of Combinatorics, 18(1998), 275-276.

  34. H. Wang, Vertex-disjoint triangles in claw-free graphs with minimum degree at least three, COMBINATORICA, 18(3)(1998), 441--447.

  35. H. Wang, Vertex-disjoint hexagons with chords in a bipartite graph, Discrete Mathematics, 187(1998), 221--231.

  36. H. Wang, Triangles in a claw-free graph, Discrete Mathematics, 187(1998), 233-244.

  37. D. M. Berman, A. Radcliffe, A. Scott, H. Wang and L. Wargo, All trees contain a large induced subgraph having all degrees 1 (mod $k$), Discrete Mathematics, 175(1997), 35--40.

  38. Charles Little, Kee Teo, and Hong Wang, On a conjecture on directed cycles in a directed bipartite graph, Graphs and Combinatorics, 13(1997), 267--273.

  39. H. Wang, On vertex-disjoint complete subgraphs of a graph, The Australasian Journal of Combinatorics, 16(1997), 165--173.

  40. H. Wang, Covering a graph with cycles passing through given edges, Journal of Graph Theory, 26(1997), 105--109.

  41. H. Wang, Packing two bipartite graphs into a bipartite graph, Journal of Graph Theory, 26(1997), 95--104.

  42. Y. Peng, C. Little, K. Teo and H. Wang, Chromatic equivalence classes of certain generalized polygon trees, Discrete Mathematics, 172(1997), 103--114.

  43. H. Wang and N. Sauer, The chromatic number of the 2-packing of a forest, The mathematics of Paul Erd\"{o}s, II, 99--120, \underline{Algorithms Combin., 14,} Springer, Berlin, 1997.

  44. D. M. Berman, H. Wang and L. Wargo, Odd induced subgraphs in graphs of maximum degree three, The Australasian Journal of Combinatorics, 15(1997), 81-85.

  45. H. Wang, On long cycles in a bipartite graph, Graphs and Combinatorics, 12(1996), 373--384.

  46. H. Wang, C. Little and K. Teo, Partition of a directed bipartite graph into two directed cycles, Discrete Mathematics, 160(1996), 283--289.

  47. H. Wang, Packing two forests into a bipartite graph, Journal of Graph Theory, Vol. 23, No. 2(1996), 209--213.

  48. H. Wang, On the maximum number of independent cycles in a bipartite graph, Journal of Combinatorial Theory, Series B, 67(1996), 152--164.

  49. H. Wang, Two vertex-disjoint cycles in a graph, Graphs and Combinatorics, 11(1995), 389--396.

  50. H. Wang and N. Sauer, packing of three copies of a graph, Journal of Graph Theory, Vol. 21, No. 1(1996), 71--80.

  51. H. Wang, Covering a graph with cycles, Journal of Graph Theory, Vol. 20, No.2 (1995), 203--211.

  52. C. Little and H. Wang, Vertex-disjoint cycles in a directed graph, The Australasian Journal of Combinatorics, 12(1995), 113-119.

  53. H. Wang, Independent cycles with limited size in a graph, Graphs and Combinatorics, 10(1994), 271--281.

  54. H. Wang, Packing a forest with a graph, The Australasian Journal of Combinatorics, vol. 10(1994), 205--210.

  55. H. Wang, On $K_{1,k}$-factorizations of a complete bipartite graph, Discrete Mathematics, 126(1994), 359--364.

  56. H. Wang, Path factors of bipartite graphs, Journal of Graph Theory, Vol.18, No.2 (1994), 161--167.

  57. H. Wang and N. Sauer, Packing three copies of a tree into a complete graph, European J. of Combinatorics 14 (1993), 137--142.

  58. H. Wang, Partition of a bipartite graph into cycles, Discrete Mathematics, 117(1993), 287--291.

  59. H. Wang, $P_{2p}$-factorization of a complete bipartite graph, Discrete Mathematics, 120(1993), 307--308.

  60. H. Wang, The maximum size of a critical 3-edge-connected graph of order $n$, Journal of Mathematics(Wuhan, PRC), Vol.6, No.4(1986), 381--384.

October 2010