default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCun-Quan Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j119]Yan Cao, Guangming Jing, Rong Luo, Vahan Mkrtchyan, Cun-Quan Zhang, Yue Zhao:
Decomposition of class II graphs into two class I graphs. Discret. Math. 346(12): 113610 (2023)- [j118]Liangchen Li, Chong Li, Rong Luo, Cun-Quan Zhang, Hailiang Zhang:
Flows of 3-edge-colorable cubic signed graphs. Eur. J. Comb. 108: 103627 (2023) - [j117]Siyan Liu, Rong-Xia Hao, Rong Luo, Cun-Quan Zhang
:
5-Cycle Double Covers, 4-Flows, and Catlin Reduction. SIAM J. Discret. Math. 37(1): 253-267 (2023) - 2022
- [j116]Jiaao Li, Yulai Ma, Zhengke Miao, Yongtang Shi, Weifan Wang, Cun-Quan Zhang:
Nowhere-zero 3-flows in toroidal graphs. J. Comb. Theory B 153: 61-80 (2022) - [i3]Yan Cao, Guangming Jing, Rong Luo, Vahan Mkrtchyan, Cun-Quan Zhang, Yue Zhao:
Decomposition of class II graphs into two class I graphs. CoRR abs/2211.05930 (2022) - 2021
- [j115]Siyan Liu, Rong-Xia Hao, Cun-Quan Zhang:
Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction. Appl. Math. Comput. 410: 126441 (2021) - [j114]Siyan Liu, Rong-Xia Hao, Cun-Quan Zhang:
Berge-Fulkerson coloring for some families of superposition snarks. Eur. J. Comb. 96: 103344 (2021) - [j113]Matt DeVos, Jiaao Li, You Lu, Rong Luo, Cun-Quan Zhang, Zhang Zhang:
Flows on flow-admissible signed graphs. J. Comb. Theory B 149: 198-221 (2021) - [j112]Siyan Liu, Rong-Xia Hao, Cun-Quan Zhang, Zhang Zhang:
Berge-Fulkerson coloring for C ( 12 ) -linked permutation graphs. J. Graph Theory 98(4): 662-675 (2021) - [j111]Scott Payne, Edgar Fuller, George Spirou, Cun-Quan Zhang:
Diffusion profile embedding as a basis for graph vertex similarity. Netw. Sci. 9(3): 328-353 (2021) - [j110]Miaomiao Han, Jiaao Li, Rong Luo, Yongtang Shi, Cun-Quan Zhang:
Integer Flows and Modulo Orientations of Signed Graphs. SIAM J. Discret. Math. 35(1): 376-391 (2021) - [i2]Scott Payne, Edgar Fuller, George Spirou, Cun-Quan Zhang:
The Automatic Quasi-clique Merger algorithm (AQCM). CoRR abs/2103.04186 (2021) - 2020
- [j109]Peter Luo, Cun-Quan Zhang, Xiao-Dong Zhang:
Wiener index of unicycle graphs with given number of even degree vertices. Discret. Math. Algorithms Appl. 12(4): 2050054:1-2050054:13 (2020) - [j108]Jiaao Li, Yezhou Wu, Cun-Quan Zhang:
Circular flows via extended Tutte orientations. J. Comb. Theory B 145: 307-322 (2020) - [j107]You Lu, Rong Luo, Michael Schubert, Eckhard Steffen, Cun-Quan Zhang:
Flows on Signed Graphs without Long Barbells. SIAM J. Discret. Math. 34(4): 2166-2182 (2020) - [i1]Scott Payne, Edgar Fuller, Cun-Quan Zhang:
Edge-cuts Optimized for Average Weight: a new alternative to Ford and Fulkerson. CoRR abs/2002.00263 (2020)
2010 – 2019
- 2019
- [j106]Scott Payne, Edgar Fuller, Cun-Quan Zhang:
Edge-Cuts of Optimal Average Weights. Asia Pac. J. Oper. Res. 36(2): 1940006:1-1940006:9 (2019) - [j105]Arthur Hoffmann-Ostenhof, Cun-Quan Zhang, Zhang Zhang:
Cycle double covers and non-separating cycles. Eur. J. Comb. 81: 276-284 (2019) - [j104]You Lu, Jian Cheng, Rong Luo, Cun-Quan Zhang:
Shortest circuit covers of signed graphs. J. Comb. Theory B 134: 164-178 (2019) - [j103]Herbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang:
Cycle covers (III) - Compatible circuit decomposition and K5-transition minor. J. Comb. Theory B 137: 25-54 (2019) - [j102]Tong Li, Zi-Xia Song, Guanghui Wang, Donglei Yang, Cun-Quan Zhang:
Antimagic orientations of even regular graphs. J. Graph Theory 90(1): 46-53 (2019) - [j101]Xiao Wang, You Lu, Cun-Quan Zhang, Shenggui Zhang:
Six-flows on almost balanced signed graphs. J. Graph Theory 92(4): 394-404 (2019) - 2018
- [j100]Jian Cheng, Hong-Jian Lai, Kate J. Lorenzen, Rong Luo, Joshua C. Thompson, Cun-Quan Zhang:
r-hued coloring of sparse graphs. Discret. Appl. Math. 237: 75-81 (2018) - [j99]Jiaao Li, Rong Luo, Hongping Ma, Cun-Quan Zhang:
Flow-contractible configurations and group connectivity of signed graphs. Discret. Math. 341(11): 3227-3236 (2018) - [j98]You Lu, Rong Luo, Cun-Quan Zhang:
Multiple weak 2-linkage and its applications on integer flows of signed graphs. Eur. J. Comb. 69: 36-48 (2018) - [j97]Jiaao Li, Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang:
The flow index and strongly connected orientations. Eur. J. Comb. 70: 164-177 (2018) - [j96]Liying Kang, Weihua Lu, Yezhou Wu, Dong Ye, Cun-Quan Zhang:
Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs. Graphs Comb. 34(2): 365-372 (2018) - [j95]Miaomiao Han, Jiaao Li, Yezhou Wu, Cun-Quan Zhang:
Counterexamples to Jaeger's Circular Flow Conjecture. J. Comb. Theory B 131: 1-11 (2018) - [j94]Rongxia Hao, Cun-Quan Zhang, Ting Zheng:
Berge-Fulkerson coloring for C(8)-linked graphs. J. Graph Theory 88(1): 46-60 (2018) - [j93]Jian Cheng, You Lu, Rong Luo, Cun-Quan Zhang:
Signed Graphs: From Modulo Flows to Integer-Valued Flows. SIAM J. Discret. Math. 32(2): 956-965 (2018) - 2017
- [j92]Yezhou Wu, Cun-Quan Zhang, Bao-Xuan Zhu:
Vertex-coloring 3-edge-weighting of some graphs. Discret. Math. 340(2): 154-159 (2017) - [j91]Herbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang:
Compatible Cycle Decomposition of bad K5-minor-free graphs. Electron. Notes Discret. Math. 61: 445-449 (2017) - [j90]Jian Cheng, Cun-Quan Zhang, Bao-Xuan Zhu:
Even factors of graphs. J. Comb. Optim. 33(4): 1343-1353 (2017) - 2016
- [j89]Yezhou Wu, Dong Ye, Cun-Quan Zhang:
Uniquely forced perfect matching and unique 3-edge-coloring. Discret. Appl. Math. 215: 203-207 (2016) - [j88]Zhengke Miao, Xiaofeng Wang, Cun-Quan Zhang:
Hamilton Circuits and Essential Girth of Claw Free Graphs. Graphs Comb. 32(1): 311-321 (2016) - [j87]Xingqin Qi, Ruth Luo, Edgar Fuller, Rong Luo, Cun-Quan Zhang:
Signed Quasi-Clique Merger: A New Clustering Method for Signed Networks with Positive and Negative Edges. Int. J. Pattern Recognit. Artif. Intell. 30(3): 1650006:1-1650006:20 (2016) - [j86]Qiang Zhu, Guodong Guo, Wenliang Tang, Cun-Quan Zhang:
A diagnosis algorithm by using graph-coloring under the PMC model. J. Comb. Optim. 32(3): 960-969 (2016) - [j85]Cun-Quan Zhang:
Cycle covers (II) - Circuit chain, Petersen chain and Hamilton weights. J. Comb. Theory B 120: 36-63 (2016) - [j84]Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang:
The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture. J. Comb. Theory B 121: 308-325 (2016) - [j83]Xinmin Hou, Hong-Jian Lai, Cun-Quan Zhang:
On Perfect Matching Coverings and Even Subgraph Coverings. J. Graph Theory 81(1): 83-91 (2016) - 2015
- [j82]Zhengke Miao, Xiaofeng Wang, Cun-Quan Zhang:
Unique Fulkerson coloring of Petersen minor-free cubic graphs. Eur. J. Comb. 43: 165-171 (2015) - [j81]Xingqin Qi, Edgar Fuller, Rong Luo, Guodong Guo, Cun-Quan Zhang:
Laplacian Energy of Digraphs and a Minimum Laplacian Energy Algorithm. Int. J. Found. Comput. Sci. 26(3): 367-380 (2015) - [j80]Zhengke Miao, Wenliang Tang, Cun-Quan Zhang:
Strong Circuit Double Cover of Some Cubic Graphs. J. Graph Theory 78(2): 131-142 (2015) - [j79]Xingqin Qi, Edgar Fuller, Rong Luo, Cun-Quan Zhang:
A novel centrality method for weighted networks based on the Kirchhoff polynomial. Pattern Recognit. Lett. 58: 51-60 (2015) - [j78]Yi Wang, Jian Cheng, Rong Luo, Cun-Quan Zhang:
Vector Flows and Integer Flows. SIAM J. Discret. Math. 29(4): 2166-2178 (2015) - 2014
- [j77]Qiang Zhu, Wenliang Tang, Cun-Quan Zhang:
Perfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture. Discret. Appl. Math. 166: 282-286 (2014) - [j76]Rong Luo, Zhengke Miao, Rui Xu, Cun-Quan Zhang:
Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts. Eur. J. Comb. 36: 7-16 (2014) - [j75]Yezhou Wu, Rong Luo, Dong Ye, Cun-Quan Zhang:
A note on an extremal problem for group-connectivity. Eur. J. Comb. 40: 137-141 (2014) - [j74]Xingqin Qi, Wenliang Tang, Yezhou Wu, Guodong Guo, Eddie Fuller, Cun-Quan Zhang:
Optimal local community detection in social networks based on density drop of subgraphs. Pattern Recognit. Lett. 36: 46-53 (2014) - [j73]Yezhou Wu, Dong Ye, Wenan Zang, Cun-Quan Zhang:
Nowhere-Zero 3-Flows in Signed Graphs. SIAM J. Discret. Math. 28(3): 1628-1637 (2014) - 2013
- [j72]Zhengke Miao, Dong Ye, Cun-Quan Zhang:
Circuit extension and circuit double cover of graphs. Discret. Math. 313(20): 2055-2060 (2013) - [j71]László Miklós Lovász, Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang:
Nowhere-zero 3-flows and modulo k-orientations. J. Comb. Theory B 103(5): 587-598 (2013) - 2012
- [j70]Yang Xiang, Cun-Quan Zhang, Kun Huang:
Predicting glioblastoma prognosis networks using weighted gene co-expression network analysis on TCGA data. BMC Bioinform. 13(S-2): S12 (2012) - [j69]Xiao-Dong Zhang, Cun-Quan Zhang:
Kotzig frames and circuit double covers. Discret. Math. 312(1): 174-180 (2012) - [j68]Ronald J. Gould, Wenliang Tang, Erling Wei, Cun-Quan Zhang:
The edge spectrum of the saturation number for small paths. Discret. Math. 312(17): 2682-2689 (2012) - [j67]Dong Ye, Cun-Quan Zhang:
Cycle double covers and the semi-Kotzig frame. Eur. J. Comb. 33(4): 624-631 (2012) - [j66]Xingqin Qi, Eddie Fuller, Qin Wu, Yezhou Wu, Cun-Quan Zhang:
Laplacian centrality: A new centrality measure for weighted networks. Inf. Sci. 194: 240-253 (2012) - [j65]Jinlong Shu, Cun-Quan Zhang, Taoye Zhang:
Flows and parity subgraphs of graphs with large odd-edge-connectivity. J. Comb. Theory B 102(4): 839-851 (2012) - [j64]Xinmin Hou, Hong-Jian Lai, Ping Li, Cun-Quan Zhang:
Group connectivity of complementary graphs. J. Graph Theory 69(4): 464-470 (2012) - [j63]Xinmin Hou, Cun-Quan Zhang:
A note on shortest cycle covers of cubic graphs. J. Graph Theory 71(2): 123-127 (2012) - [c6]Eddie Fuller, Wenliang Tang, Yezhou Wu, Cun-Quan Zhang:
Optimal Clustering Selection on Hierarchical System Network. ASONAM 2012: 1085-1089 - 2011
- [j62]Hongliang Lu, Qinglin Yu, Cun-Quan Zhang:
Vertex-coloring 2-edge-weighting of graphs. Eur. J. Comb. 32(1): 21-27 (2011) - [j61]Peixin Zhao, Cun-Quan Zhang:
A new clustering method and its application in social networks. Pattern Recognit. Lett. 32(15): 2109-2118 (2011) - [c5]Qin Wu, Robert Duval, Edgar Fuller, Xingqin Qi, Cun-Quan Zhang, Arian Spahiu, Kyle Christensen:
Modeling Network Changes: Systemic Centrality in Foreign Policy Interaction Analysis. ASONAM 2011: 690-695 - 2010
- [j60]Cun-Quan Zhang:
Cycle covers (I) - Minimal contra pairs and Hamilton weights. J. Comb. Theory B 100(5): 419-438 (2010) - [j59]Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cun-Quan Zhang:
NZ-flows in strong products of graphs. J. Graph Theory 64(4): 267-276 (2010) - [c4]Xingqin Qi, Kyle Christensen, Robert Duval, Edgar Fuller, Arian Spahiu, Qin Wu, Cun-Quan Zhang:
A Hierarchical Algorithm for Clustering Extremist Web Pages. ASONAM 2010: 458-463 - [p2]Qin Wu, Eddie Fuller, Cun-Quan Zhang:
Graph Model for Pattern Recognition in Text. Mining and Analyzing Social Networks 2010: 1-20
2000 – 2009
- 2009
- [j58]Xiaofeng Wang, Cun-Quan Zhang, Taoye Zhang:
Nowhere-zero 4-flow in almost Petersen-minor free graphs. Discret. Math. 309(5): 1025-1032 (2009) - [j57]Jianbing Niu, Cun-Quan Zhang:
Cliques, minors and apex graphs. Discret. Math. 309(12): 4095-4107 (2009) - [j56]Rongxia Hao, Jianbing Niu, Xiaofeng Wang, Cun-Quan Zhang, Taoye Zhang:
A note on Berge-Fulkerson coloring. Discret. Math. 309(13): 4235-4240 (2009) - [j55]Dezheng Xie, Cun-Quan Zhang:
Flows, flow-pair covers and cycle double covers. Discret. Math. 309(14): 4682-4689 (2009) - [j54]Yezhou Wu, Wenan Zang, Cun-Quan Zhang:
A Characterization of Almost CIS Graphs. SIAM J. Discret. Math. 23(2): 749-753 (2009) - [c3]Qin Wu, Eddie Fuller, Cun-Quan Zhang:
Text Document Classification and Pattern Recognition. ASONAM 2009: 405-410 - 2008
- [j53]Genghua Fan, Hong-Jian Lai, Rui Xu, Cun-Quan Zhang, Chuixiang Zhou:
Nowhere-zero 3-flows in triangularly connected graphs. J. Comb. Theory B 98(6): 1325-1336 (2008) - [j52]Rong Luo, Rui Xu, Wenan Zang, Cun-Quan Zhang:
Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows. SIAM J. Discret. Math. 22(2): 500-519 (2008) - [j51]Cun-Quan Zhang, Yongbin Ou:
Clustering, community partition and disjoint spanning trees. ACM Trans. Algorithms 4(3): 35:1-35:26 (2008) - 2007
- [j50]Hong-Jian Lai, Rui Xu, Cun-Quan Zhang:
On Circular Flows Of Graphs. Comb. 27(2): 245-246 (2007) - [j49]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
- [j48]Rui Xu, Cun-Quan Zhang:
On flows in bidirected graphs. Discret. Math. 299(1-3): 335-343 (2005) - [j47]Jinlong Shu, Cun-Quan Zhang:
A note about shortest cycle covers. Discret. Math. 301(2-3): 232-238 (2005) - [j46]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) - [j45]Rong Luo, Cun-Quan Zhang:
Edge-face chromatic number and edge chromatic number of simple plane graphs. J. Graph Theory 49(3): 234-256 (2005) - [j44]Jinlong Shu, Cun-Quan Zhang:
Nowhere-zero 3-flows in products of graphs. J. Graph Theory 50(1): 79-89 (2005) - [p1]Yunkai Liu, Cun-Quan Zhang:
A linear solution for haplotype Perfect Phylogeny Problem (Extended Abstract). Advances in Bioinformatics and Its Applications 2005 - 2004
- [j43]Rong Luo, Wenan Zang, Cun-Quan Zhang:
Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares. Comb. 24(4): 641-657 (2004) - [j42]Rong Luo, Cun-Quan Zhang:
Edge coloring of graphs with small average degrees. Discret. Math. 275(1-3): 207-218 (2004) - 2003
- [j41]Rui Xu, Cun-Quan Zhang:
Nowhere-Zero 3-Flows in Squares of Graphs. Electron. J. Comb. 10 (2003) - [j40]Jinquan Dong, Yanpei Liu, Cun-Quan Zhang:
Determination of the star valency of a graph. Discret. Appl. Math. 126(2-3): 291-296 (2003) - [j39]Xuechao Li, Cun-Quan Zhang:
Chords of longest circuits in 3-connected graphs. Discret. Math. 268(1-3): 199-206 (2003) - [j38]Xuechao Li, Cun-Quan Zhang:
Chords of longest circuits of graphs embedded in torus and Klein bottle. J. Graph Theory 43(1): 1-23 (2003) - [c2]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 - 2002
- [j37]Rong Luo, Cun-Quan Zhang:
Total chromatic number of graphs with small genus. Electron. Notes Discret. Math. 11: 468-477 (2002) - [j36]William Klostermeyer, Cun-Quan Zhang:
n-Tuple Coloring of Planar Graphs with Large Odd Girth. Graphs Comb. 18(1): 119-132 (2002) - [j35]Cun-Quan Zhang:
Circular flows of nearly Eulerian graphs and vertex-splitting. J. Graph Theory 40(3): 147-161 (2002) - 2001
- [j34]Cun-Quan Zhang:
On strong 1-factors and Hamilton weights of cubic graphs. Discret. Math. 230(1-3): 143-148 (2001) - [j33]Hong-Jian Lai, Cun-Quan Zhang:
Hamilton weights and Petersen minors. J. Graph Theory 38(4): 197-219 (2001) - 2000
- [j32]John L. Goldwasser, Cun-Quan Zhang:
Uniquely Edge-3-Colorable Graphs and Snarks. Graphs Comb. 16(3): 257-267 (2000) - [j31]Genghua Fan, Cun-Quan Zhang:
Circuit Decompositions of Eulerian Graphs. J. Comb. Theory B 78(1): 1-23 (2000) - [j30]William Klostermeyer, Cun-Quan Zhang:
(2 + ϵ)-Coloring of planar graphs with large odd-girth. J. Graph Theory 33(2): 109-119 (2000)
1990 – 1999
- 1999
- [j29]John L. Goldwasser, Cun-Quan Zhang:
Permutation graphs and Petersen graph. Ars Comb. 51 (1999) - 1998
- [j28]Carla D. Savage, Cun-Quan Zhang:
The connectivity of acyclic orientation graphs. Discret. Math. 184(1-3): 281-287 (1998) - [j27]Katherine Heinrich, Jiping Liu, Cun-Quan Zhang:
Triangle-Free Circuit Decompositions and Petersen Minor. J. Comb. Theory B 72(2): 197-207 (1998) - [j26]Luis A. Goddyn, Michael Tarsi, Cun-Quan Zhang:
On (k, d)-colorings and fractional nowhere-zero flows. J. Graph Theory 28(3): 155-161 (1998) - 1997
- [j25]Marjorie Darrah, Yi-Ping Liu, Cun-Quan Zhang:
Cycles of all lengths in arc-3-cyclic semicomplete digraphs. Discret. Math. 173(1-3): 23-33 (1997) - [j24]K. Sekine, Cun-Quan Zhang:
Decomposition of the Flow Polynomial. Graphs Comb. 13(2): 189-196 (1997) - 1996
- [j23]Cun-Quan Zhang:
Nowhere-zero 4-flows and cycle double covers. Discret. Math. 154(1-3): 245-253 (1996) - [j22]Cun-Quan Zhang:
On embeddings of graphs containing no K5-minor. J. Graph Theory 21(4): 401-404 (1996) - [j21]Brian Alspach, Yi-Ping Liu, Cun-Quan Zhang:
Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups. SIAM J. Discret. Math. 9(1): 151-154 (1996) - 1995
- [j20]Cun-Quan Zhang:
Hamiltonian weights and unique 3-edge-colorings of cubic graphs. J. Graph Theory 20(1): 91-99 (1995) - 1994
- [j19]Hong-Jian Lai, Xingxing Yu, Cun-Quan Zhang:
Small Circuit Double Covers of Cubic Multigraphs. J. Comb. Theory B 60(2): 177-194 (1994) - [j18]Hong-Jian Lai, Cun-Quan Zhang:
Edge-maximal (k, i)-graphs. J. Graph Theory 18(3): 227-240 (1994) - 1993
- [j17]Brian Alspach, Cun-Quan Zhang:
Cycle covers of cubic multigraphs. Discret. Math. 111(1-3): 11-17 (1993) - [j16]Cun-Quan Zhang:
Parity Subgraph, Shortest Cycle Cover and Postman Tour. SIAM J. Discret. Math. 6(3): 428-431 (1993) - 1992
- [j15]Hong-Jian Lai, Cun-Quan Zhang:
Nowhere-zero 3-flows of highly connected graphs. Discret. Math. 110(1-3): 179-183 (1992) - [j14]Cun-Quan Zhang, Yongjin Zhu:
Factorizations of regular graphs. J. Comb. Theory B 56(1): 74-89 (1992) - 1991
- [j13]Cun-Quan Zhang, Yongjin Zhu:
Long path connectivity of regular graphs. Discret. Math. 96(2): 151-160 (1991) - [j12]Stephen C. Locke, Cun-Quan Zhang:
Cycles through three vertices in 2-connected graphs. Graphs Comb. 7(3): 265-269 (1991) - [c1]Cun-Quan Zhang:
Cycle cover theorems and their applications. Graph Structure Theory 1991: 405-417 - 1990
- [j11]Cun-Quan Zhang:
Minimum cycle coverings and integer flows. J. Graph Theory 14(5): 537-546 (1990) - [j10]Cun-Quan Zhang:
Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems. SIAM J. Discret. Math. 3(3): 431-438 (1990)
1980 – 1989
- 1989
- [j9]Cun-Quan Zhang:
Bridges of longest cycles. Discret. Math. 78(1-2): 195-211 (1989) - [j8]Cun-Quan Zhang:
Cycles of given length in some K1, 3-free graphs. Discret. Math. 78(3): 307-313 (1989) - [j7]Cun-Quan Zhang:
Circumference and girth. J. Graph Theory 13(4): 485-490 (1989) - 1988
- [j6]Cun-Quan Zhang:
Hamilton cycles in claw-free graphs. J. Graph Theory 12(2): 209-216 (1988) - 1987
- [j5]Cun-Quan Zhang:
Longest cycles and their chords. J. Graph Theory 11(4): 521-529 (1987) - 1984
- [j4]Cun-Quan Zhang:
Optimal alphabetic binary tree for a nonregular cost function. Discret. Appl. Math. 8(3): 307-312 (1984) - 1983
- [j3]Cun-Quan Zhang, Weixuan Li:
A class of hypergraphs satisfying an inequality of Lovász. J. Comb. Theory B 34(2): 224-228 (1983) - 1982
- [j2]Cun-Quan Zhang:
Arc-disjoint circuits in digraphs. Discret. Math. 41(1): 79-96 (1982) - [j1]Tian Feng, Zheng-Sheng Wu, Cun-Quan Zhang:
Cycles of each length in tournaments. J. Comb. Theory B 33(3): 245-255 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
