Research Publications

October 2010

  1. Peng, Y. and Wang, H., On Packing Trees into Complete Bipartite Graphs, Wuhan University Journal of Natural Science, Vol. 28, No. 3 (2023), 221-222.

  2. H. Wang, Y. Wang and J. Yan, Disjoint cycles in a directed graph with partial degree, SIAM Discrete Mathematics, Vol. 37, No. 1 (2023), 221-232.

  3. Peng, Y. and Wang, H., Packing trees into complete k-partite graphs, Bull. Korean Math. Soc. 59(2022), No. 2, pp. 345-350.

  4. Peng, Y. and Wang, H., On a Conjecture of Embeddable Graphs, Wuhan University Journal of Natural Science, Vol. 26 No. 2 (2021), 123-127.

  5. Y. Gao, H. Wang and Q. Zou, Disjoint directed cycles with specified length in directed bipartite graphs, Discrete Mathematics, 344(4)(2021), 112276.

  6. H.Wang, Disjoint directed cycles in directed graphs, Discrete Mathematics, 343(8)(2020), 111927.

  7. H. Wang, Disjoint cycles covering matchings in graphs with partial degrees, Journal of Graph Theory, 93(2020), 450-457.

  8. Y. Gao, X. Lin and H. Wang, Vertex-disjoint double chorded cycles in bipartite graphs, Discrete Mathematics, 342(2019), No. 9, 2482-2492.

  9. H. Wang, Bipacking a bipartite graph with girth at least 12, J. Korean Math. Soc. 56 (2019), No. 1, pp. 25-37.

  10. H. Wang, Disjoint cycles of order at least 5, AUSTRALASIAN JOURNAL OF COMBINATORICS, Volume 71(1) (2018), Pages 54-67.

  11. H. Wang, Covering a Graph with Cycles of Length at least 4, the electronic journal of combinatorics 25(1) (2018), #P1.67.

  12. Z.H. Jiao, H. Wang and J. Yan, Disjoint cycles in graphs with distance degree sum conditions, Discrete Mathematics, Vol. 340(6) (2017), 1203-1209.

  13. H. Wang, Covering a subset with two cycles, AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 65(1) (2016), Pages 27-36.

  14. H. Wang, Partial Degree Conditions and Cycle Coverings, Journal of Graph Theory, 78(2015), 295-304.

  15. H. Wang, Disjoint cycles with prescribed lengths and independent edges in graphs, J. Korean Math. Soc. 51 (2014), No. 5, pp. 919-940.

  16. Sean P. Haler and Hong Wang, Packing four copies of a tree into a complete graph. Australas. J. Combin. 59 (2014), 323-332.

  17. H. Wang, Disjoint Long Cycles in a Graph, SCIENCE CHINA MATHEMATICS, 56(2013), 1983-1998.

  18. H. Wang, An Extension of the Corradi-Hajnal Theorem, Australasian Journal of Combinatorics, 54(2012), 59-84.

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

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

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

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

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

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

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

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

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

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

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

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

  31. 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.

  32. 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.

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

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

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

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

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

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

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

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

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

  42. 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.

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

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

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

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

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

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

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

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

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

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

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

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

  55. 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.

  56. 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.

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

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

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

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

  61. 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.

  62. 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  78. 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