According to our database
1,
Cun-Quan Zhang
authored at least 130 papers
between 1982 and 2025.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2025
Six-flows of signed graphs with frustration index three.
Discret. Math., 2025
2023
Decomposition of class II graphs into two class I graphs.
Discret. Math., December, 2023
5-Cycle Double Covers, 4-Flows, and Catlin Reduction.
SIAM J. Discret. Math., March, 2023
Flows of 3-edge-colorable cubic signed graphs.
Eur. J. Comb., 2023
2022
Nowhere-zero 3-flows in toroidal graphs.
J. Comb. Theory B, 2022
2021
Integer Flows and Modulo Orientations of Signed Graphs.
SIAM J. Discret. Math., 2021
Diffusion profile embedding as a basis for graph vertex similarity.
Netw. Sci., 2021
Berge-Fulkerson coloring for C ( 12 ) -linked permutation graphs.
J. Graph Theory, 2021
Flows on flow-admissible signed graphs.
J. Comb. Theory B, 2021
Berge-Fulkerson coloring for some families of superposition snarks.
Eur. J. Comb., 2021
The Automatic Quasi-clique Merger algorithm (AQCM).
CoRR, 2021
Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction.
Appl. Math. Comput., 2021
2020
Flows on Signed Graphs without Long Barbells.
SIAM J. Discret. Math., 2020
Circular flows via extended Tutte orientations.
J. Comb. Theory B, 2020
Wiener index of unicycle graphs with given number of even degree vertices.
Discret. Math. Algorithms Appl., 2020
Edge-cuts Optimized for Average Weight: a new alternative to Ford and Fulkerson.
CoRR, 2020
2019
Six-flows on almost balanced signed graphs.
J. Graph Theory, 2019
Antimagic orientations of even regular graphs.
J. Graph Theory, 2019
Shortest circuit covers of signed graphs.
J. Comb. Theory B, 2019
Cycle covers (III) - Compatible circuit decomposition and <i>K</i><sub>5</sub>-transition minor.
J. Comb. Theory B, 2019
Cycle double covers and non-separating cycles.
Eur. J. Comb., 2019
Edge-Cuts of Optimal Average Weights.
Asia Pac. J. Oper. Res., 2019
2018
Signed Graphs: From Modulo Flows to Integer-Valued Flows.
SIAM J. Discret. Math., 2018
Berge-Fulkerson coloring for C(8)-linked graphs.
J. Graph Theory, 2018
Counterexamples to Jaeger's Circular Flow Conjecture.
J. Comb. Theory B, 2018
Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs.
Graphs Comb., 2018
Multiple weak 2-linkage and its applications on integer flows of signed graphs.
Eur. J. Comb., 2018
The flow index and strongly connected orientations.
Eur. J. Comb., 2018
Flow-contractible configurations and group connectivity of signed graphs.
Discret. Math., 2018
r-hued coloring of sparse graphs.
Discret. Appl. Math., 2018
2017
Compatible Cycle Decomposition of bad K<sub>5</sub>-minor-free graphs.
Electron. Notes Discret. Math., 2017
Vertex-coloring 3-edge-weighting of some graphs.
Discret. Math., 2017
2016
On Perfect Matching Coverings and Even Subgraph Coverings.
J. Graph Theory, 2016
Cycle covers (II) - Circuit chain, Petersen chain and Hamilton weights.
J. Comb. Theory B, 2016
The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture.
J. Comb. Theory B, 2016
A diagnosis algorithm by using graph-coloring under the PMC model.
J. Comb. Optim., 2016
Signed Quasi-Clique Merger: A New Clustering Method for Signed Networks with Positive and Negative Edges.
Int. J. Pattern Recognit. Artif. Intell., 2016
Hamilton Circuits and Essential Girth of Claw Free Graphs.
Graphs Comb., 2016
Uniquely forced perfect matching and unique 3-edge-coloring.
Discret. Appl. Math., 2016
2015
Vector Flows and Integer Flows.
SIAM J. Discret. Math., 2015
A novel centrality method for weighted networks based on the Kirchhoff polynomial.
Pattern Recognit. Lett., 2015
Strong Circuit Double Cover of Some Cubic Graphs.
J. Graph Theory, 2015
Laplacian Energy of Digraphs and a Minimum Laplacian Energy Algorithm.
Int. J. Found. Comput. Sci., 2015
Unique Fulkerson coloring of Petersen minor-free cubic graphs.
Eur. J. Comb., 2015
2014
Nowhere-Zero 3-Flows in Signed Graphs.
SIAM J. Discret. Math., 2014
Optimal local community detection in social networks based on density drop of subgraphs.
Pattern Recognit. Lett., 2014
A note on an extremal problem for group-connectivity.
Eur. J. Comb., 2014
Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts.
Eur. J. Comb., 2014
Perfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture.
Discret. Appl. Math., 2014
2013
Nowhere-zero 3-flows and modulo k-orientations.
J. Comb. Theory B, 2013
Circuit extension and circuit double cover of graphs.
Discret. Math., 2013
2012
A note on shortest cycle covers of cubic graphs.
J. Graph Theory, 2012
Group connectivity of complementary graphs.
J. Graph Theory, 2012
Flows and parity subgraphs of graphs with large odd-edge-connectivity.
J. Comb. Theory B, 2012
Laplacian centrality: A new centrality measure for weighted networks.
Inf. Sci., 2012
Cycle double covers and the semi-Kotzig frame.
Eur. J. Comb., 2012
Kotzig frames and circuit double covers.
Discret. Math., 2012
The edge spectrum of the saturation number for small paths.
Discret. Math., 2012
Predicting glioblastoma prognosis networks using weighted gene co-expression network analysis on TCGA data.
BMC Bioinform., 2012
Optimal Clustering Selection on Hierarchical System Network.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012
2011
A new clustering method and its application in social networks.
Pattern Recognit. Lett., 2011
Vertex-coloring 2-edge-weighting of graphs.
Eur. J. Comb., 2011
Modeling Network Changes: Systemic Centrality in Foreign Policy Interaction Analysis.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2011
2010
Graph Model for Pattern Recognition in Text.
Proceedings of the Mining and Analyzing Social Networks, 2010
NZ-flows in strong products of graphs.
J. Graph Theory, 2010
Cycle covers (I) - Minimal contra pairs and Hamilton weights.
J. Comb. Theory B, 2010
A Hierarchical Algorithm for Clustering Extremist Web Pages.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2010
2009
A Characterization of Almost CIS Graphs.
SIAM J. Discret. Math., 2009
Flows, flow-pair covers and cycle double covers.
Discret. Math., 2009
Nowhere-zero 4-flow in almost Petersen-minor free graphs.
Discret. Math., 2009
Cliques, minors and apex graphs.
Discret. Math., 2009
A note on Berge-Fulkerson coloring.
Discret. Math., 2009
Text Document Classification and Pattern Recognition.
Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining, 2009
2008
Clustering, community partition and disjoint spanning trees.
ACM Trans. Algorithms, 2008
Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows.
SIAM J. Discret. Math., 2008
Nowhere-zero 3-flows in triangularly connected graphs.
J. Comb. Theory B, 2008
2007
Chords of longest circuits in locally planar graphs.
Eur. J. Comb., 2007
On Circular Flows Of Graphs.
Comb., 2007
2005
Nowhere-zero 3-flows in products of graphs.
J. Graph Theory, 2005
Edge-face chromatic number and edge chromatic number of simple plane graphs.
J. Graph Theory, 2005
On the structure of <i>k</i>-connected graphs without <i>K<sub>k</sub></i>-minor.
Eur. J. Comb., 2005
On flows in bidirected graphs.
Discret. Math., 2005
A note about shortest cycle covers.
Discret. Math., 2005
A linear solution for haplotype Perfect Phylogeny Problem (Extended Abstract).
Proceedings of the Advances in Bioinformatics and Its Applications, 2005
2004
Edge coloring of graphs with small average degrees.
Discret. Math., 2004
Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares.
Comb., 2004
2003
Chords of longest circuits of graphs embedded in torus and Klein bottle.
J. Graph Theory, 2003
Chords of longest circuits in 3-connected graphs.
Discret. Math., 2003
Determination of the star valency of a graph.
Discret. Appl. Math., 2003
Nowhere-Zero 3-Flows in Squares of Graphs.
Electron. J. Comb., 2003
Identifying Regulatory Signals in DNA-Sequences with a Non-statistical Approximation Approach.
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003
2002
Circular flows of nearly Eulerian graphs and vertex-splitting.
J. Graph Theory, 2002
n-Tuple Coloring of Planar Graphs with Large Odd Girth.
Graphs Comb., 2002
Total chromatic number of graphs with small genus.
Electron. Notes Discret. Math., 2002
2001
Hamilton weights and Petersen minors.
J. Graph Theory, 2001
On strong 1-factors and Hamilton weights of cubic graphs.
Discret. Math., 2001
2000
(2 + ϵ)-Coloring of planar graphs with large odd-girth.
J. Graph Theory, 2000
Circuit Decompositions of Eulerian Graphs.
J. Comb. Theory B, 2000
Uniquely Edge-3-Colorable Graphs and Snarks.
Graphs Comb., 2000
1999
Permutation graphs and Petersen graph.
Ars Comb., 1999
1998
On (<i>k</i>, <i>d</i>)-colorings and fractional nowhere-zero flows.
J. Graph Theory, 1998
Triangle-Free Circuit Decompositions and Petersen Minor.
J. Comb. Theory B, 1998
The connectivity of acyclic orientation graphs.
Discret. Math., 1998
1997
Decomposition of the Flow Polynomial.
Graphs Comb., 1997
Cycles of all lengths in arc-3-cyclic semicomplete digraphs.
Discret. Math., 1997
1996
Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups.
SIAM J. Discret. Math., 1996
On embeddings of graphs containing no <i>K</i><sub>5</sub>-minor.
J. Graph Theory, 1996
Nowhere-zero 4-flows and cycle double covers.
Discret. Math., 1996
1995
Hamiltonian weights and unique 3-edge-colorings of cubic graphs.
J. Graph Theory, 1995
1994
Edge-maximal (<i>k, i</i>)-graphs.
J. Graph Theory, 1994
Small Circuit Double Covers of Cubic Multigraphs.
J. Comb. Theory B, 1994
1993
Parity Subgraph, Shortest Cycle Cover and Postman Tour.
SIAM J. Discret. Math., 1993
Cycle covers of cubic multigraphs.
Discret. Math., 1993
1992
Factorizations of regular graphs.
J. Comb. Theory B, 1992
Nowhere-zero 3-flows of highly connected graphs.
Discret. Math., 1992
1991
Cycles through three vertices in 2-connected graphs.
Graphs Comb., 1991
Long path connectivity of regular graphs.
Discret. Math., 1991
Cycle cover theorems and their applications.
Proceedings of the Graph Structure Theory, 1991
1990
Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems.
SIAM J. Discret. Math., 1990
Minimum cycle coverings and integer flows.
J. Graph Theory, 1990
1989
Cycles of given length in some K<sub>1, 3</sub>-free graphs.
Discret. Math., 1989
Bridges of longest cycles.
Discret. Math., 1989
1988
Hamilton cycles in claw-free graphs.
J. Graph Theory, 1988
1987
Longest cycles and their chords.
J. Graph Theory, 1987
1984
Optimal alphabetic binary tree for a nonregular cost function.
Discret. Appl. Math., 1984
1983
A class of hypergraphs satisfying an inequality of Lovász.
J. Comb. Theory B, 1983
1982
Cycles of each length in tournaments.
J. Comb. Theory B, 1982
Arc-disjoint circuits in digraphs.
Discret. Math., 1982
