Search the dblp DataBase

Publications of Author

1. Hong Wang
   Directed Bipartite Graphs Containing Every Possible Pair of Directed Cycles. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 2001, v:60, n:, pp:- [Journal]
   
2. Hong Wang
   On Quadrilaterals and Cycle Covers in a Bipartite Graph. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 2001, v:58, n:, pp:- [Journal]
   
3. Hong Wang
   Maximal Total Length Of k Disjoint Cycles In Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2005, v:25, n:3, pp:367-377 [Journal]
   
4. Hong Wang
   Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1998, v:18, n:3, pp:441-447 [Journal]
   
5. Yoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang
   Existence of two disjoint long cycles in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:305, n:1-3, pp:154-169 [Journal]
   
6. Yoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang
   Covering vertices of a graph by k disjoint cycles. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:270, n:1-3, pp:114-124 [Journal]
   
7. Yoshiyas Ishigami, Hong Wang
   An extension of a theorem on cycles containing specified independent edges. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:245, n:1-3, pp:127-137 [Journal]
   
8. Hong Wang
   Vertex-disjoint quadrilaterals in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:288, n:1-3, pp:149-166 [Journal]
   
9. Hong Wang, Norbert Sauer
   Packing Three Copies of a Tree into a Complete Graph. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1993, v:14, n:2, pp:137-142 [Journal]
   
10. Bert Randerath, Ingo Schiermeyer, Hong Wang
    On quadrilaterals in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:203, n:1-3, pp:229-237 [Journal]
    
11. Hong Wang
    On the maximum number of independent cycles in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:205, n:1-3, pp:183-190 [Journal]
    
12. Hong Wang
    Bipartite graphs containing every possible pair of cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:207, n:1-3, pp:233-242 [Journal]
    
13. Hong Wang
    Triangles in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:187, n:1-3, pp:233-244 [Journal]
    
14. Hong Wang
    Vertex-disjoint hexagons with chords in a bipartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:187, n:1-3, pp:221-231 [Journal]
    
15. David M. Berman, A. J. Radcliffe, Alex D. Scott, Hong Wang, Larry Wargo
    All trees contain a large induced subgraph having all degrees 1 (mod k). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:175, n:1-3, pp:35-40 [Journal]
    
16. Hong Wang
    Partition of a bipartite graph into cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:117, n:1-3, pp:287-291 [Journal]
    
17. Hong Wang
    P_2p-factorization of a complete bipartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:307-308 [Journal]
    
18. Hong Wang, Charles H. C. Little, Kee L. Teo
    Partition of a directed bipartite graph into two directed cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:160, n:1-3, pp:283-289 [Journal]
    
19. Hong Wang
    On K_{1, k}-factorizations of a complete bipartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:126, n:1-3, pp:359-364 [Journal]