|
Search the dblp DataBase
Yongjin Zhu:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Xiangwen Li, Bing Wei, Zhengguang Yu, Yongjin Zhu
Hamilton cycles in 1-tough triangle-free graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:254, n:1-3, pp:275-287 [Journal]
- Bing Wei, Yongjin Zhu
The Chvátal-ErdImages condition for panconnectivity of triangle-free graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:252, n:1-3, pp:203-214 [Journal]
- Yu Sheng, Feng Tian, Jianglu Wang, Bing Wei, Yongjin Zhu
Path extendability of claw-free graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:16, pp:2010-2015 [Journal]
- Cun-Quan Zhang, Yongjin Zhu
Factorizations of regular graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1992, v:56, n:1, pp:74-89 [Journal]
- Yongjin Zhu, Chuanping Chen
An extreme problem concerning k-arc-cyclic property for a class of tournaments. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:85, n:3, pp:301-311 [Journal]
- Yongjin Zhu, Feng Tian, Xiaotie Deng
More powerful closure operations on graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:87, n:2, pp:197-214 [Journal]
- Cun-Quan Zhang, Yongjin Zhu
Long path connectivity of regular graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:96, n:2, pp:151-160 [Journal]
- Bill Jackson, Hao Li, Yongjin Zhu
Dominating cycles in regular 3-connected graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:102, n:2, pp:163-176 [Journal]
- Yongjin Zhu, Hao Li
Hamilton cycles in regular 3-connected graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:110, n:1-3, pp:229-249 [Journal]
Search in 0.002secs, Finished in 0.002secs
|