2008 |
39 | EE | Cun-Quan Zhang,
Yongbin Ou:
Clustering, community partition and disjoint spanning trees.
ACM Transactions on Algorithms 4(3): (2008) |
38 | EE | Genghua Fan,
Hong-Jian Lai,
Rui Xu,
Cun-Quan Zhang,
Chuixiang Zhou:
Nowhere-zero 3-flows in triangularly connected graphs.
J. Comb. Theory, Ser. B 98(6): 1325-1336 (2008) |
37 | EE | Rong Luo,
Rui Xu,
Wenan Zang,
Cun-Quan Zhang:
Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows.
SIAM J. Discrete Math. 22(2): 500-519 (2008) |
2007 |
36 | EE | Hong-Jian Lai,
Rui Xu,
Cun-Quan Zhang:
On Circular Flows Of Graphs.
Combinatorica 27(2): 245-246 (2007) |
35 | EE | Ken-ichi Kawarabayashi,
Jianbing Niu,
Cun-Quan Zhang:
Chords of longest circuits in locally planar graphs.
Eur. J. Comb. 28(1): 315-321 (2007) |
2005 |
34 | EE | Rui Xu,
Cun-Quan Zhang:
On flows in bidirected graphs.
Discrete Mathematics 299(1-3): 335-343 (2005) |
33 | EE | Jinlong Shu,
Cun-Quan Zhang:
A note about shortest cycle covers.
Discrete Mathematics 301(2-3): 232-238 (2005) |
32 | EE | Ken-ichi Kawarabayashi,
Rong Luo,
Jianbing Niu,
Cun-Quan Zhang:
On the structure of k-connected graphs without Kk-minor.
Eur. J. Comb. 26(3-4): 293-308 (2005) |
31 | EE | Rong Luo,
Cun-Quan Zhang:
Edge-face chromatic number and edge chromatic number of simple plane graphs.
Journal of Graph Theory 49(3): 234-256 (2005) |
30 | EE | Jinlong Shu,
Cun-Quan Zhang:
Nowhere-zero 3-flows in products of graphs.
Journal of Graph Theory 50(1): 79-89 (2005) |
2004 |
29 | EE | Rong Luo,
Wenan Zang,
Cun-Quan Zhang:
Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares.
Combinatorica 24(4): 641-657 (2004) |
28 | EE | Rong Luo,
Cun-Quan Zhang:
Edge coloring of graphs with small average degrees.
Discrete Mathematics 275(1-3): 207-218 (2004) |
2003 |
27 | EE | Cun-Quan Zhang,
Yunkai Liu,
Elaine M. Eschen,
Keqiang Wu:
Identifying Regulatory Signals in DNA-Sequences with a Non-statistical Approximation Approach.
CSB 2003: 593-597 |
26 | | Jinquan Dong,
Yanpei Liu,
Cun-Quan Zhang:
Determination of the star valency of a graph.
Discrete Applied Mathematics 126(2-3): 291-296 (2003) |
25 | EE | Xuechao Li,
Cun-Quan Zhang:
Chords of longest circuits in 3-connected graphs.
Discrete Mathematics 268(1-3): 199-206 (2003) |
24 | EE | Rui Xu,
Cun-Quan Zhang:
Nowhere-Zero 3-Flows in Squares of Graphs.
Electr. J. Comb. 10: (2003) |
2002 |
23 | EE | Rong Luo,
Cun-Quan Zhang:
Total chromatic number of graphs with small genus.
Electronic Notes in Discrete Mathematics 11: 468-477 (2002) |
22 | EE | William Klostermeyer,
Cun-Quan Zhang:
n-Tuple Coloring of Planar Graphs with Large Odd Girth.
Graphs and Combinatorics 18(1): 119-132 (2002) |
2001 |
21 | EE | Cun-Quan Zhang:
On strong 1-factors and Hamilton weights of cubic graphs.
Discrete Mathematics 230(1-3): 143-148 (2001) |
2000 |
20 | EE | Genghua Fan,
Cun-Quan Zhang:
Circuit Decompositions of Eulerian Graphs.
J. Comb. Theory, Ser. B 78(1): 1-23 (2000) |
1999 |
19 | | John L. Goldwasser,
Cun-Quan Zhang:
Permutation graphs and Petersen graph.
Ars Comb. 51: (1999) |
1998 |
18 | EE | Carla D. Savage,
Cun-Quan Zhang:
The connectivity of acyclic orientation graphs.
Discrete Mathematics 184(1-3): 281-287 (1998) |
17 | EE | Katherine Heinrich,
Jiping Liu,
Cun-Quan Zhang:
Triangle-Free Circuit Decompositions and Petersen Minor.
J. Comb. Theory, Ser. B 72(2): 197-207 (1998) |
1997 |
16 | EE | Marjorie Darrah,
Yi-Ping Liu,
Cun-Quan Zhang:
Cycles of all lengths in arc-3-cyclic semicomplete digraphs.
Discrete Mathematics 173(1-3): 23-33 (1997) |
1996 |
15 | EE | Cun-Quan Zhang:
Nowhere-zero 4-flows and cycle double covers.
Discrete Mathematics 154(1-3): 245-253 (1996) |
14 | EE | Brian Alspach,
Yi-Ping Liu,
Cun-Quan Zhang:
Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups.
SIAM J. Discrete Math. 9(1): 151-154 (1996) |
1994 |
13 | EE | Hong-Jian Lai,
Xingxing Yu,
Cun-Quan Zhang:
Small Circuit Double Covers of Cubic Multigraphs.
J. Comb. Theory, Ser. B 60(2): 177-194 (1994) |
1993 |
12 | EE | Brian Alspach,
Cun-Quan Zhang:
Cycle covers of cubic multigraphs.
Discrete Mathematics 111(1-3): 11-17 (1993) |
11 | | Cun-Quan Zhang:
Parity Subgraph, Shortest Cycle Cover and Postman Tour.
SIAM J. Discrete Math. 6(3): 428-431 (1993) |
1992 |
10 | EE | Hong-Jian Lai,
Cun-Quan Zhang:
Nowhere-zero 3-flows of highly connected graphs.
Discrete Mathematics 110(1-3): 179-183 (1992) |
9 | EE | Cun-Quan Zhang,
Yongjin Zhu:
Factorizations of regular graphs.
J. Comb. Theory, Ser. B 56(1): 74-89 (1992) |
1991 |
8 | | Cun-Quan Zhang:
Cycle cover theorems and their applications.
Graph Structure Theory 1991: 405-418 |
7 | EE | Cun-Quan Zhang,
Yongjin Zhu:
Long path connectivity of regular graphs.
Discrete Mathematics 96(2): 151-160 (1991) |
1990 |
6 | | Cun-Quan Zhang:
Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems.
SIAM J. Discrete Math. 3(3): 431-438 (1990) |
1989 |
5 | EE | Cun-Quan Zhang:
Bridges of longest cycles.
Discrete Mathematics 78(1-2): 195-211 (1989) |
4 | EE | Cun-Quan Zhang:
Cycles of given length in some K1, 3-free graphs.
Discrete Mathematics 78(3): 307-313 (1989) |
1983 |
3 | EE | Cun-Quan Zhang,
Li Weixuan:
A class of hypergraphs satisfying an inequality of Lovász.
J. Comb. Theory, Ser. B 34(2): 224-228 (1983) |
1982 |
2 | EE | Cun-Quan Zhang:
Arc-disjoint circuits in digraphs.
Discrete Mathematics 41(1): 79-96 (1982) |
1 | EE | Tian Feng,
Zheng-Sheng Wu,
Cun-Quan Zhang:
Cycles of each length in tournaments.
J. Comb. Theory, Ser. B 33(3): 245-255 (1982) |