![]() | ![]() |
2008 | ||
---|---|---|
7 | EE | Yuanqiu Huang, Tinglei Zhao: The crossing number of K1, 4, n. Discrete Mathematics 308(9): 1634-1638 (2008) |
2007 | ||
6 | EE | Yuanqiu Huang, Yuming Chu: A note on the computational complexity of graph vertex partition. Discrete Applied Mathematics 155(3): 405-409 (2007) |
2005 | ||
5 | EE | Yuanqiu Huang, Tinglei Zhao: Maximum genus, connectivity and minimal degree of graphs. Discrete Mathematics 300(1-3): 110-119 (2005) |
2003 | ||
4 | EE | Yuanqiu Huang: Maximum genus of a graph in terms of its embedding properties. Discrete Mathematics 262(1-3): 171-180 (2003) |
3 | EE | Yuanqiu Huang: Maximum genus and chromatic number of graphs. Discrete Mathematics 271(1-3): 117-127 (2003) |
2000 | ||
2 | EE | Yuanqiu Huang, Yanpei Liu: Face Size and the Maximum Genus of a Graph 1. Simple Graphs. J. Comb. Theory, Ser. B 80(2): 356-370 (2000) |
1999 | ||
1 | EE | Yuanqiu Huang, Yanpei Liu: The maximum genus of graphs with diameter three. Discrete Mathematics 194(1-3): 139-149 (1999) |
1 | Yuming Chu | [6] |
2 | Yanpei Liu | [1] [2] |
3 | Tinglei Zhao | [5] [7] |