selected publications
-
academic article
- PACKING TREES INTO COMPLETE K-PARTITE GRAPH. Bulletin of the Korean Mathematical Society. 59:345-350. 2022
- Disjoint directed cycles in directed graphs. Discrete Mathematics. 343:UNSP 111927. 2020
- Disjoint cycles in graphs with distance degree sum conditions. Discrete Mathematics. 340.0:1203.0-1209.0. 2017
- Covering a subset with two cycles. Australasian Journal of Combinatorics. 65:27-36. 2016
- Partial Degree Conditions and Cycle Coverings. Journal of Graph Theory. 78:295-304. 2015
- Disjoint long cycles in a graph. Science China-mathematics. 56:1983-1998. 2013
- An Extension of the Corradi-Hajnal Theorem. Australasian Journal of Combinatorics. 54:59-84. 2012
- Disjoint 5-cycles in a graph. Discussiones Mathematicae Graph Theory. 32:221-242. 2012
- Disjoint triangles and pentagons in a graph. Australasian Journal of Combinatorics. 46:79-89. 2010
- Proof of the ErdAs-Faudree Conjecture on Quadrilaterals. Graphs and Combinatorics. 26:833-877. 2010
- Packing Three Copies of a Tree into a Complete Bipartite Graph. Annals of Combinatorics. 13:261-269. 2009
- Packing Two Copies of a Sparse Graph into a Graph with Restrained Maximum Degree. Journal of Graph Theory. 62:178-187. 2009
- Packing Two Copies of a graph into a Graph with Restrained Maximum Degree. Journal of Graph Theory. 62:178-187. 2009
- Disjoint triangles and quadrilaterals in a graph. Central European Journal of Mathematics. 6:543-558. 2008
- Pentagons and cycle coverings. Journal of Graph Theory. 54:194-208. 2007
- Existence of two disjoint long cycles in graphs. Discrete Mathematics. 305:154-169. 2005
- Disjoint directed quadrilaterals in a directed graph. Journal of Graph Theory. 50:91-104. 2005
- Maximal total length of k disjoint cycles in bipartite graphs. Combinatorica. 25:367-377. 2005
- On large cycles with lengths differing by one or two. Australasian Journal of Combinatorics. 33:329-333. 2005
- A minimum degree result for disjoint cycles and forests in bipartite graphs. Australasian Journal of Combinatorics. 29:35-47. 2004
- Vertex-disjoint quadrilaterals in graphs. Discrete Mathematics. 288:149-166. 2004
- Covering vertices of a graph by k disjoint cycles. Discrete Mathematics. 270:115-125. 2003
- An extension of a theorem on cycles containing specified independent edges. Discrete Mathematics. 245:127-137. 2002
- On covering a bipartite graph with cycles. SIAMS Discrete Mathematics. 1:86-96. 2002
- Directed bipartite graphs containing every possible pair of directed cycles. Ars Combinatoria. 60:293-306. 2001
- On independent cycles in a bipartite graph. Graphs and Combinatorics. 17:177-183. 2001
- On quadrilaterals and cycle covers in a bipartite graph. Ars Combinatoria. 58:301-311. 2001
- Vertex-disjoint cycles containing specified edges. Graphs and Combinatorics. 16:81-92. 2000
- Digraphs containing every possible pair of dicycles. Journal of Graph Theory. 34:154-162. 2000
- Independent directed triangles in a directed graph. Graphs and Combinatorics. 16:453-462. 2000
- Large disjoint cycles in a bipartite graph. Graphs and Combinatorics. 16:359-366. 2000
- Large vertex-disjoint cycles in a bipartite graph. Graphs and Combinatorics. 16:359-366. 2000
- On the Maximal Number of Vertices Covered by Disjoint Cycles. Australasian Journal of Combinatorics. 21:179-186. 2000
- On the maximum number of independent cycles in a graph. Discrete Mathematics. 205:183-190. 1999
- On quadrilaterals in a graph. Discrete Mathematics. 203:229-237. 1999
- Bipartite graphs containing every possible pair of cycles. Discrete Mathematics. 207:233-242. 1999
- Covering a bipartite graph with cycles passing through given edges. Australasian Journal of Combinatorics. 19:115-121. 1999
- Fusion in bipartite graphs. New Zealand Journal of Mathematics. 28:225-236. 1999
- On 2-factors of a bipartite graph. Journal of Graph Theory. 31:101-106. 1999
- On vertex-disjoint complete bipartite subgraphs in a bipartite graph. Graphs and Combinatorics. 15:353-364. 1999
- Proof of a conjecture on cycles in a bipartite graph. Journal of Graph Theory. 31:333-343. 1999
- Induced stars in trees. Australasian Journal of Combinatorics. 18:275-276. 1998
- Triangles in a claw-free graph. Discrete Mathematics. 187:233-244. 1998
- Vertex-disjoint hexagons with chords in a bipartite graph. Discrete Mathematics. 187:221-231. 1998
- Vertex-disjoint triangles in claw-free graphs with minimum degree at least three. Combinatorica. 18:441-447. 1998
- All trees contain a large induced subgraph having all degrees 1 (mod k). Discrete Mathematics. 175:35-40. 1997
- Chromatic equivalence classes of certain generalized polygon trees. Discrete Mathematics. 172:103-114. 1997
- Covering a graph with cycles passing through given edges. Journal of Graph Theory. 26:105-109. 1997
- Odd induced subgraphs in graphs of maximum degree three. Australasian Journal of Combinatorics. 15:81-85. 1997
- On vertex-disjoint complete subgraphs of a graph. Australasian Journal of Combinatorics. 16:165-173. 1997
- Packing two bipartite graphs into a bipartite graph. Journal of Graph Theory. 26:95-104. 1997
- On the maximum number of independent cycles in a bipartite graph. Journal of Combinatorial Theory, B. 67:152-164. 1996
- On long cycles in a bipartite graph. Graphs and Combinatorics. 12:373-384. 1996
- Packing of three copies of a graph. Journal of Graph Theory. 21:71-80. 1996
- Packing two forests into a bipartite graph. Journal of Graph Theory. 23:209-213. 1996
- Partition of a directed bipartite graph into two directed cycles. Discrete Mathematics. 160:283-289. 1996
- Covering a graph with cycles. Journal of Graph Theory. 20:203-211. 1995
- Two vertex-disjoint cycles in a graph. Graphs and Combinatorics. 11:389-396. 1995
- Vertex-disjoint cycles in a directed graph. Australasian Journal of Combinatorics. 12:113-119. 1995
- On K1,k-factorizations of a complete bipartite graph. Discrete Mathematics. 126:359-364. 1994
- Independent cycles with limited size in a graph. Graphs and Combinatorics. 10:271-281. 1994
- On a conjecture on directed cycles in a directed bipartite graph. Graphs and Combinatorics. 13:267-273. 1994
- Packing a forest with a graph. Australasian Journal of Combinatorics. 10:205-210. 1994
- Path factors of bipartite graphs. Journal of Graph Theory. 18:161-167. 1994
- P2p-factorization of a complete bipartite graph. Discrete Mathematics. 120:307-308. 1993
- Packing three copies of a tree into a complete graph. European Journal of Combinatorics. 14:137-142. 1993
- Partition of a bipartite graph into cycles. Discrete Mathematics. 117:287-291. 1993
- The maximum size of a critical 3-edge-connected graph of order n. Journal of Graph Theory. 6:381-384. 1986
- Disjoint Cycles Covering Matchings in Graphs with Partial Degrees. Journal of Graph Theory.
-
book
- Graph Theory (Chinese). Wuhan University Press. 1984