| 2008 |
|---|
| 8 | EE | Jian-Hua Yin,
Gang Chen,
John R. Schmitt:
Graphic sequences with a realization containing a generalized friendship graph.
Discrete Mathematics 308(24): 6226-6232 (2008) |
| 2007 |
|---|
| 7 | EE | Jian-Hua Yin,
Jiong-Sheng Li:
Potentially Kr1, r2, ..., rl, r, s-graphic sequences.
Discrete Mathematics 307(9-10): 1167-1177 (2007) |
| 2005 |
|---|
| 6 | | Jian-Hua Yin,
Jiong-Sheng Li,
Guo-Liang Chen:
The Smallest Degree Sum that Yields Potentially K2s-graphic Sequences.
Ars Comb. 74: (2005) |
| 5 | EE | Jian-Hua Yin,
Jiong-Sheng Li:
Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size.
Discrete Mathematics 301(2-3): 218-227 (2005) |
| 4 | EE | Jian-Hua Yin,
Jiong-Sheng Li,
Guo-Liang Chen,
Cheng Zhong:
On the fault-tolerant diameter and wide diameter of omega-connected graphs.
Networks 45(2): 88-94 (2005) |
| 2004 |
|---|
| 3 | EE | Jian-Hua Yin,
Jiong-Sheng Li,
Guo-Liang Chen:
A variation of a classical Turán-type extremal problem.
Eur. J. Comb. 25(7): 989-1002 (2004) |
| 2003 |
|---|
| 2 | EE | Jian-Hua Yin,
Jiong-Sheng Li:
An extremal problem on potentially Kr, s-graphic sequences.
Discrete Mathematics 260(1-3): 295-305 (2003) |
| 1 | EE | Jian-Hua Yin,
Jiong-Sheng Li,
Guo-Liang Chen:
The smallest degree sum that yields potentially kCl-graphic sequences.
Discrete Mathematics 270(1-3): 318-326 (2003) |
