Cun-Quan Zhang

ORCID

Publication Activity (10 Years)

Years Active: 1982-2023
Publications (10 Years): 45

Top Venues

J. Comb. Theory, Ser. B

Eur. J. Comb.

SIAM J. Discret. Math.

J. Graph Theory

Publications

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) (2023)
Liangchen Li, Chong Li, Rong Luo, Cun-Quan Zhang, Hailiang Zhang
Flows of 3-edge-colorable cubic signed graphs. Eur. J. Comb. 108 (2023)
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) (2023)
Jiaao Li, Yulai Ma, Zhengke Miao, Yongtang Shi, Weifan Wang, Cun-Quan Zhang
Nowhere-zero 3-flows in toroidal graphs. J. Comb. Theory, Ser. B 153 (2022)
Yan Cao, Guangming Jing, Rong Luo, Vahan Mkrtchyan, Cun-Quan Zhang, Yue Zhao
Decomposition of class II graphs into two class I graphs. CoRR (2022)
Siyan Liu, Rong-Xia Hao, Cun-Quan Zhang
Berge-Fulkerson coloring for some families of superposition snarks. Eur. J. Comb. 96 (2021)
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) (2021)
Siyan Liu, Rong-Xia Hao, Cun-Quan Zhang
Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction. Appl. Math. Comput. 410 (2021)
Scott Payne, Edgar Fuller, George Spirou, Cun-Quan Zhang
The Automatic Quasi-clique Merger algorithm (AQCM). CoRR (2021)
Scott Payne, Edgar Fuller, George Spirou, Cun-Quan Zhang
Diffusion profile embedding as a basis for graph vertex similarity. Netw. Sci. 9 (3) (2021)
Matt DeVos, Jiaao Li, You Lu, Rong Luo, Cun-Quan Zhang, Zhang Zhang
Flows on flow-admissible signed graphs. J. Comb. Theory, Ser. B 149 (2021)
Siyan Liu, Rong-Xia Hao, Cun-Quan Zhang, Zhang Zhang
Berge-Fulkerson coloring for C ( 12 ) -linked permutation graphs. J. Graph Theory 98 (4) (2021)
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) (2020)
Scott Payne, Edgar Fuller, Cun-Quan Zhang
Edge-cuts Optimized for Average Weight: a new alternative to Ford and Fulkerson. CoRR (2020)
Jiaao Li, Yezhou Wu, Cun-Quan Zhang
Circular flows via extended Tutte orientations. J. Comb. Theory, Ser. B 145 (2020)
You Lu, Rong Luo, Michael Schubert, Eckhard Steffen, Cun-Quan Zhang
Flows on Signed Graphs without Long Barbells. SIAM J. Discret. Math. 34 (4) (2020)
Scott Payne, Edgar Fuller, Cun-Quan Zhang
Edge-Cuts of Optimal Average Weights. Asia Pac. J. Oper. Res. 36 (2) (2019)
You Lu, Jian Cheng, Rong Luo, Cun-Quan Zhang
Shortest circuit covers of signed graphs. J. Comb. Theory, Ser. B 134 (2019)
Tong Li, Zi-Xia Song, Guanghui Wang, Donglei Yang, Cun-Quan Zhang
Antimagic orientations of even regular graphs. J. Graph Theory 90 (1) (2019)
Xiao Wang, You Lu, Cun-Quan Zhang, Shenggui Zhang
Six-flows on almost balanced signed graphs. J. Graph Theory 92 (4) (2019)
Herbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang
-transition minor. J. Comb. Theory, Ser. B 137 (2019)
Arthur Hoffmann-Ostenhof, Cun-Quan Zhang, Zhang Zhang
Cycle double covers and non-separating cycles. Eur. J. Comb. 81 (2019)
Liying Kang, Weihua Lu, Yezhou Wu, Dong Ye, Cun-Quan Zhang
Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs. Graphs Comb. 34 (2) (2018)
Rongxia Hao, Cun-Quan Zhang, Ting Zheng
Berge-Fulkerson coloring for C(8)-linked graphs. J. Graph Theory 88 (1) (2018)
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 (2018)
Jiaao Li, Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang
The flow index and strongly connected orientations. Eur. J. Comb. 70 (2018)
Jiaao Li, Rong Luo, Hongping Ma, Cun-Quan Zhang
Flow-contractible configurations and group connectivity of signed graphs. Discret. Math. 341 (11) (2018)
Jian Cheng, You Lu, Rong Luo, Cun-Quan Zhang
Signed Graphs: From Modulo Flows to Integer-Valued Flows. SIAM J. Discret. Math. 32 (2) (2018)
Miaomiao Han, Jiaao Li, Yezhou Wu, Cun-Quan Zhang
Counterexamples to Jaeger's Circular Flow Conjecture. J. Comb. Theory, Ser. B 131 (2018)
You Lu, Rong Luo, Cun-Quan Zhang
Multiple weak 2-linkage and its applications on integer flows of signed graphs. Eur. J. Comb. 69 (2018)
Herbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang
-minor-free graphs. Electron. Notes Discret. Math. 61 (2017)
Jian Cheng, Cun-Quan Zhang, Bao-Xuan Zhu
Even factors of graphs. J. Comb. Optim. 33 (4) (2017)
Yezhou Wu, Cun-Quan Zhang, Bao-Xuan Zhu
Vertex-coloring 3-edge-weighting of some graphs. Discret. Math. 340 (2) (2017)
Cun-Quan Zhang
Cycle covers (II) - Circuit chain, Petersen chain and Hamilton weights. J. Comb. Theory, Ser. B 120 (2016)
Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang
The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture. J. Comb. Theory, Ser. B 121 (2016)
Xinmin Hou, Hong-Jian Lai, Cun-Quan Zhang
On Perfect Matching Coverings and Even Subgraph Coverings. J. Graph Theory 81 (1) (2016)
Zhengke Miao, Xiaofeng Wang, Cun-Quan Zhang
Hamilton Circuits and Essential Girth of Claw Free Graphs. Graphs Comb. 32 (1) (2016)
Yezhou Wu, Dong Ye, Cun-Quan Zhang
Uniquely forced perfect matching and unique 3-edge-coloring. Discret. Appl. Math. 215 (2016)
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) (2016)
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) (2016)
Zhengke Miao, Xiaofeng Wang, Cun-Quan Zhang
Unique Fulkerson coloring of Petersen minor-free cubic graphs. Eur. J. Comb. 43 (2015)
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) (2015)
Zhengke Miao, Wenliang Tang, Cun-Quan Zhang
Strong Circuit Double Cover of Some Cubic Graphs. J. Graph Theory 78 (2) (2015)
Yi Wang, Jian Cheng, Rong Luo, Cun-Quan Zhang
Vector Flows and Integer Flows. SIAM J. Discret. Math. 29 (4) (2015)
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 (2015)
Qiang Zhu, Wenliang Tang, Cun-Quan Zhang
Perfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture. Discret. Appl. Math. 166 (2014)
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 (2014)
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 (2014)
Yezhou Wu, Rong Luo, Dong Ye, Cun-Quan Zhang
A note on an extremal problem for group-connectivity. Eur. J. Comb. 40 (2014)
Yezhou Wu, Dong Ye, Wenan Zang, Cun-Quan Zhang
Nowhere-Zero 3-Flows in Signed Graphs. SIAM J. Discret. Math. 28 (3) (2014)
Zhengke Miao, Dong Ye, Cun-Quan Zhang
Circuit extension and circuit double cover of graphs. Discret. Math. 313 (20) (2013)
László Miklós Lovász, Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang
Nowhere-zero 3-flows and modulo k-orientations. J. Comb. Theory, Ser. B 103 (5) (2013)
Xinmin Hou, Hong-Jian Lai, Ping Li, Cun-Quan Zhang
Group connectivity of complementary graphs. J. Graph Theory 69 (4) (2012)
Xingqin Qi, Eddie Fuller, Qin Wu, Yezhou Wu, Cun-Quan Zhang
Laplacian centrality: A new centrality measure for weighted networks. Inf. Sci. 194 (2012)
Jinlong Shu, Cun-Quan Zhang, Taoye Zhang
Flows and parity subgraphs of graphs with large odd-edge-connectivity. J. Comb. Theory, Ser. B 102 (4) (2012)
Dong Ye, Cun-Quan Zhang
Cycle double covers and the semi-Kotzig frame. Eur. J. Comb. 33 (4) (2012)
Xiao-Dong Zhang, Cun-Quan Zhang
Kotzig frames and circuit double covers. Discret. Math. 312 (1) (2012)
Xinmin Hou, Cun-Quan Zhang
A note on shortest cycle covers of cubic graphs. J. Graph Theory 71 (2) (2012)
Eddie Fuller, Wenliang Tang, Yezhou Wu, Cun-Quan Zhang
Optimal Clustering Selection on Hierarchical System Network. ASONAM (2012)
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) (2012)
Ronald J. Gould, Wenliang Tang, Erling Wei, Cun-Quan Zhang
The edge spectrum of the saturation number for small paths. Discret. Math. 312 (17) (2012)
Peixin Zhao, Cun-Quan Zhang
A new clustering method and its application in social networks. Pattern Recognit. Lett. 32 (15) (2011)
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)
Hongliang Lu, Qinglin Yu, Cun-Quan Zhang
Vertex-coloring 2-edge-weighting of graphs. Eur. J. Comb. 32 (1) (2011)
Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cun-Quan Zhang
NZ-flows in strong products of graphs. J. Graph Theory 64 (4) (2010)
Cun-Quan Zhang
Cycle covers (I) - Minimal contra pairs and Hamilton weights. J. Comb. Theory, Ser. B 100 (5) (2010)
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)
Xiaofeng Wang, Cun-Quan Zhang, Taoye Zhang
Nowhere-zero 4-flow in almost Petersen-minor free graphs. Discret. Math. 309 (5) (2009)
Qin Wu, Eddie Fuller, Cun-Quan Zhang
Text Document Classification and Pattern Recognition. ASONAM (2009)
Dezheng Xie, Cun-Quan Zhang
Flows, flow-pair covers and cycle double covers. Discret. Math. 309 (14) (2009)
Yezhou Wu, Wenan Zang, Cun-Quan Zhang
A Characterization of Almost CIS Graphs. SIAM J. Discret. Math. 23 (2) (2009)
Rongxia Hao, Jianbing Niu, Xiaofeng Wang, Cun-Quan Zhang, Taoye Zhang
A note on Berge-Fulkerson coloring. Discret. Math. 309 (13) (2009)
Jianbing Niu, Cun-Quan Zhang
Cliques, minors and apex graphs. Discret. Math. 309 (12) (2009)
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) (2008)
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) (2008)
Cun-Quan Zhang, Yongbin Ou
Clustering, community partition and disjoint spanning trees. ACM Trans. Algorithms 4 (3) (2008)
Ken-ichi Kawarabayashi, Jianbing Niu, Cun-Quan Zhang
Chords of longest circuits in locally planar graphs. Eur. J. Comb. 28 (1) (2007)
Hong-Jian Lai, Rui Xu, Cun-Quan Zhang
On Circular Flows Of Graphs. Comb. 27 (2) (2007)
Rong Luo, Cun-Quan Zhang
Edge-face chromatic number and edge chromatic number of simple plane graphs. J. Graph Theory 49 (3) (2005)
Jinlong Shu, Cun-Quan Zhang
Nowhere-zero 3-flows in products of graphs. J. Graph Theory 50 (1) (2005)
Jinlong Shu, Cun-Quan Zhang
A note about shortest cycle covers. Discret. Math. 301 (2-3) (2005)
Ken-ichi Kawarabayashi, Rong Luo, Jianbing Niu, Cun-Quan Zhang
-minor. Eur. J. Comb. 26 (3-4) (2005)
Rui Xu, Cun-Quan Zhang
On flows in bidirected graphs. Discret. Math. 299 (1-3) (2005)
Rong Luo, Wenan Zang, Cun-Quan Zhang
Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares. Comb. 24 (4) (2004)
Rong Luo, Cun-Quan Zhang
Edge coloring of graphs with small average degrees. Discret. Math. 275 (1-3) (2004)
Rui Xu, Cun-Quan Zhang
Nowhere-Zero 3-Flows in Squares of Graphs. Electron. J. Comb. 10 (2003)
Xuechao Li, Cun-Quan Zhang
Chords of longest circuits in 3-connected graphs. Discret. Math. 268 (1-3) (2003)
Jinquan Dong, Yanpei Liu, Cun-Quan Zhang
Determination of the star valency of a graph. Discret. Appl. Math. 126 (2-3) (2003)
Xuechao Li, Cun-Quan Zhang
Chords of longest circuits of graphs embedded in torus and Klein bottle. J. Graph Theory 43 (1) (2003)
Cun-Quan Zhang, Yunkai Liu, Elaine M. Eschen, Keqiang Wu
Identifying Regulatory Signals in DNA-Sequences with a Non-statistical Approximation Approach. CSB (2003)
Cun-Quan Zhang
Circular flows of nearly Eulerian graphs and vertex-splitting. J. Graph Theory 40 (3) (2002)
Rong Luo, Cun-Quan Zhang
Total chromatic number of graphs with small genus. Electron. Notes Discret. Math. 11 (2002)
William Klostermeyer, Cun-Quan Zhang
n-Tuple Coloring of Planar Graphs with Large Odd Girth. Graphs Comb. 18 (1) (2002)
Cun-Quan Zhang
On strong 1-factors and Hamilton weights of cubic graphs. Discret. Math. 230 (1-3) (2001)
Hong-Jian Lai, Cun-Quan Zhang
Hamilton weights and Petersen minors. J. Graph Theory 38 (4) (2001)
John L. Goldwasser, Cun-Quan Zhang
Uniquely Edge-3-Colorable Graphs and Snarks. Graphs Comb. 16 (3) (2000)
William Klostermeyer, Cun-Quan Zhang
(2 + ϵ)-Coloring of planar graphs with large odd-girth. J. Graph Theory 33 (2) (2000)
Genghua Fan, Cun-Quan Zhang
Circuit Decompositions of Eulerian Graphs. J. Comb. Theory, Ser. B 78 (1) (2000)
John L. Goldwasser, Cun-Quan Zhang
Permutation graphs and Petersen graph. Ars Comb. 51 (1999)
Carla D. Savage, Cun-Quan Zhang
The connectivity of acyclic orientation graphs. Discret. Math. 184 (1-3) (1998)

Cun-Quan Zhang.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Cun-Quan Zhang