Cun-Quan Zhang

Discret. Math., 2026

A note on 2-quasi-bisection of cubic graphs with oddness 2.

[BibT_eX]

[DOI]

Discret. Math., 2026

2025

Five-cycle double cover and shortest cycle cover.

[BibT_eX]

[DOI]

J. Graph Theory, January, 2025

An 8-Flow Theorem for Signed Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2025

Signed Graphs, Nonorientable Surfaces, and Integer Flows.

[BibT_eX]

[DOI]

J. Graph Theory, 2025

Six-flows of signed graphs with frustration index three.

[BibT_eX]

[DOI]

You Lu

Discret. Math., 2025

Non-separating cycles and 5-cycle double covers.

[BibT_eX]

[DOI]

Discret. Math., 2025

4-coverable snarks, perfect matching cover, and Isaacs product.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2025

Signed Circuit $6$-Covers of Signed $K_4$-Minor-Free Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

2024

Integer flows on triangularly connected signed graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2024

2023

Decomposition of class II graphs into two class I graphs.

[BibT_eX]

[DOI]

Discret. Math., December, 2023

5-Cycle Double Covers, 4-Flows, and Catlin Reduction.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2023

Flows of 3-edge-colorable cubic signed graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2023

2022

Nowhere-zero 3-flows in toroidal graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

2021

Integer Flows and Modulo Orientations of Signed Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Diffusion profile embedding as a basis for graph vertex similarity.

[BibT_eX]

[DOI]

Netw. Sci., 2021

Berge-Fulkerson coloring for C ( 12 ) -linked permutation graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Flows on flow-admissible signed graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Berge-Fulkerson coloring for some families of superposition snarks.

[BibT_eX]

[DOI]

Siyan Liu

Rong-Xia Hao

Eur. J. Comb., 2021

The Automatic Quasi-clique Merger algorithm (AQCM).

[BibT_eX]

[DOI]

CoRR, 2021

Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction.

[BibT_eX]

[DOI]

Siyan Liu

Rong-Xia Hao

Appl. Math. Comput., 2021

2020

Flows on Signed Graphs without Long Barbells.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Circular flows via extended Tutte orientations.

[BibT_eX]

[DOI]

Jiaao Li

J. Comb. Theory B, 2020

Wiener index of unicycle graphs with given number of even degree vertices.

[BibT_eX]

[DOI]

Peter Luo

Xiao-Dong Zhang

Discret. Math. Algorithms Appl., 2020

Edge-cuts Optimized for Average Weight: a new alternative to Ford and Fulkerson.

[BibT_eX]

[DOI]

Scott Payne

Edgar Fuller

CoRR, 2020

2019

Six-flows on almost balanced signed graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Antimagic orientations of even regular graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Shortest circuit covers of signed graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Cycle covers (III) - Compatible circuit decomposition and K5-transition minor.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Cycle double covers and non-separating cycles.

[BibT_eX]

[DOI]

Arthur Hoffmann-Ostenhof

Zhang Zhang

Eur. J. Comb., 2019

Edge-Cuts of Optimal Average Weights.

[BibT_eX]

[DOI]

Scott Payne

Edgar Fuller

Asia Pac. J. Oper. Res., 2019

2018

Signed Graphs: From Modulo Flows to Integer-Valued Flows.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Berge-Fulkerson coloring for C(8)-linked graphs.

[BibT_eX]

[DOI]

Rongxia Hao

Ting Zheng

J. Graph Theory, 2018

Counterexamples to Jaeger's Circular Flow Conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2018

Multiple weak 2-linkage and its applications on integer flows of signed graphs.

[BibT_eX]

[DOI]

You Lu

Eur. J. Comb., 2018

The flow index and strongly connected orientations.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Flow-contractible configurations and group connectivity of signed graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

r-hued coloring of sparse graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

Even factors of graphs.

[BibT_eX]

[DOI]

Jian Cheng

Bao-Xuan Zhu

J. Comb. Optim., 2017

Compatible Cycle Decomposition of bad K5-minor-free graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Vertex-coloring 3-edge-weighting of some graphs.

[BibT_eX]

[DOI]

Bao-Xuan Zhu

Discret. Math., 2017

2016

On Perfect Matching Coverings and Even Subgraph Coverings.

[BibT_eX]

[DOI]

Xinmin Hou

J. Graph Theory, 2016

Cycle covers (II) - Circuit chain, Petersen chain and Hamilton weights.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture.

[BibT_eX]

[DOI]

Carsten Thomassen

J. Comb. Theory B, 2016

A diagnosis algorithm by using graph-coloring under the PMC model.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Signed Quasi-Clique Merger: A New Clustering Method for Signed Networks with Positive and Negative Edges.

[BibT_eX]

[DOI]

Int. J. Pattern Recognit. Artif. Intell., 2016

Hamilton Circuits and Essential Girth of Claw Free Graphs.

[BibT_eX]

[DOI]

Xiaofeng Wang

Graphs Comb., 2016

Uniquely forced perfect matching and unique 3-edge-coloring.

[BibT_eX]

[DOI]

Dong Ye

Discret. Appl. Math., 2016

2015

Vector Flows and Integer Flows.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

A novel centrality method for weighted networks based on the Kirchhoff polynomial.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 2015

Strong Circuit Double Cover of Some Cubic Graphs.

[BibT_eX]

[DOI]

Wenliang Tang

J. Graph Theory, 2015

Laplacian Energy of Digraphs and a Minimum Laplacian Energy Algorithm.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2015

Unique Fulkerson coloring of Petersen minor-free cubic graphs.

[BibT_eX]

[DOI]

Xiaofeng Wang

Eur. J. Comb., 2015

2014

Nowhere-Zero 3-Flows in Signed Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Optimal local community detection in social networks based on density drop of subgraphs.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 2014

A note on an extremal problem for group-connectivity.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Perfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture.

[BibT_eX]

[DOI]

Qiang Zhu

Wenliang Tang

Discret. Appl. Math., 2014

2013

Nowhere-zero 3-flows and modulo k-orientations.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Circuit extension and circuit double cover of graphs.

[BibT_eX]

[DOI]

Dong Ye

Discret. Math., 2013

2012

A note on shortest cycle covers of cubic graphs.

[BibT_eX]

[DOI]

Xinmin Hou

J. Graph Theory, 2012

Group connectivity of complementary graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Flows and parity subgraphs of graphs with large odd-edge-connectivity.

[BibT_eX]

[DOI]

Jinlong Shu

Taoye Zhang

J. Comb. Theory B, 2012

Laplacian centrality: A new centrality measure for weighted networks.

[BibT_eX]

[DOI]

Inf. Sci., 2012

Cycle double covers and the semi-Kotzig frame.

[BibT_eX]

[DOI]

Dong Ye

Eur. J. Comb., 2012

Kotzig frames and circuit double covers.

[BibT_eX]

[DOI]

Xiao-Dong Zhang

Discret. Math., 2012

The edge spectrum of the saturation number for small paths.

[BibT_eX]

[DOI]

Discret. Math., 2012

Predicting glioblastoma prognosis networks using weighted gene co-expression network analysis on TCGA data.

[BibT_eX]

[DOI]

Yang Xiang

Kun Huang

BMC Bioinform., 2012

Optimal Clustering Selection on Hierarchical System Network.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Peixin Zhao

Pattern Recognit. Lett., 2011

Vertex-coloring 2-edge-weighting of graphs.

[BibT_eX]

[DOI]

Hongliang Lu

Qinglin Yu

Eur. J. Comb., 2011

Modeling Network Changes: Systemic Centrality in Foreign Policy Interaction Analysis.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2011

2010

Graph Model for Pattern Recognition in Text.

[BibT_eX]

[DOI]

Qin Wu

Eddie Fuller

Proceedings of the Mining and Analyzing Social Networks, 2010

NZ-flows in strong products of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Cycle covers (I) - Minimal contra pairs and Hamilton weights.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

A Hierarchical Algorithm for Clustering Extremist Web Pages.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2010

2009

A Characterization of Almost CIS Graphs.

[BibT_eX]

[DOI]

Wenan Zang

SIAM J. Discret. Math., 2009

Flows, flow-pair covers and cycle double covers.

[BibT_eX]

[DOI]

Dezheng Xie

Discret. Math., 2009

Nowhere-zero 4-flow in almost Petersen-minor free graphs.

[BibT_eX]

[DOI]

Xiaofeng Wang

Taoye Zhang

Discret. Math., 2009

Cliques, minors and apex graphs.

[BibT_eX]

[DOI]

Jianbing Niu

Discret. Math., 2009

A note on Berge-Fulkerson coloring.

[BibT_eX]

[DOI]

Discret. Math., 2009

Text Document Classification and Pattern Recognition.

[BibT_eX]

[DOI]

Qin Wu

Eddie Fuller

Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining, 2009

2008

Clustering, community partition and disjoint spanning trees.

[BibT_eX]

[DOI]

Yongbin Ou

ACM Trans. Algorithms, 2008

Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Nowhere-zero 3-flows in triangularly connected graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

2007

Chords of longest circuits in locally planar graphs.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Jianbing Niu

Eur. J. Comb., 2007

On Circular Flows Of Graphs.

[BibT_eX]

[DOI]

Rui Xu

Comb., 2007

2005

Nowhere-zero 3-flows in products of graphs.

[BibT_eX]

[DOI]

Jinlong Shu

J. Graph Theory, 2005

Edge-face chromatic number and edge chromatic number of simple plane graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

On the structure of k-connected graphs without Kk-minor.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Jianbing Niu

Eur. J. Comb., 2005

On flows in bidirected graphs.

[BibT_eX]

[DOI]

Rui Xu

Discret. Math., 2005

A note about shortest cycle covers.

[BibT_eX]

[DOI]

Jinlong Shu

Discret. Math., 2005

A linear solution for haplotype Perfect Phylogeny Problem (Extended Abstract).

[BibT_eX]

[DOI]

Yunkai Liu

Proceedings of the Advances in Bioinformatics and Its Applications, 2005

2004

Edge coloring of graphs with small average degrees.

[BibT_eX]

[DOI]

Discret. Math., 2004

Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares.

[BibT_eX]

[DOI]

Wenan Zang

Comb., 2004

2003

Chords of longest circuits of graphs embedded in torus and Klein bottle.

[BibT_eX]

[DOI]

Xuechao Li

J. Graph Theory, 2003

Chords of longest circuits in 3-connected graphs.

[BibT_eX]

[DOI]

Xuechao Li

Discret. Math., 2003

Determination of the star valency of a graph.

[BibT_eX]

[DOI]

Jinquan Dong

Yanpei Liu

Discret. Appl. Math., 2003

Nowhere-Zero 3-Flows in Squares of Graphs.

[BibT_eX]

[DOI]

Rui Xu

Electron. J. Comb., 2003

Identifying Regulatory Signals in DNA-Sequences with a Non-statistical Approximation Approach.

[BibT_eX]

[DOI]

Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

2002

Circular flows of nearly Eulerian graphs and vertex-splitting.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

n-Tuple Coloring of Planar Graphs with Large Odd Girth.

[BibT_eX]

[DOI]

William Klostermeyer

Graphs Comb., 2002

Total chromatic number of graphs with small genus.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2002

2001

Hamilton weights and Petersen minors.

[BibT_eX]

[DOI]

J. Graph Theory, 2001

On strong 1-factors and Hamilton weights of cubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

(2 + ϵ)-Coloring of planar graphs with large odd-girth.

[BibT_eX]

[DOI]

William Klostermeyer

J. Graph Theory, 2000

Circuit Decompositions of Eulerian Graphs.

[BibT_eX]

[DOI]

Genghua Fan

J. Comb. Theory B, 2000

Uniquely Edge-3-Colorable Graphs and Snarks.

[BibT_eX]

[DOI]

John L. Goldwasser

Graphs Comb., 2000

1999

Permutation graphs and Petersen graph.

[BibT_eX]

John L. Goldwasser

Ars Comb., 1999

1998

On (k, d)-colorings and fractional nowhere-zero flows.

[BibT_eX]

[DOI]

Luis A. Goddyn

Michael Tarsi

J. Graph Theory, 1998

Triangle-Free Circuit Decompositions and Petersen Minor.

[BibT_eX]

[DOI]

Katherine Heinrich

Jiping Liu

J. Comb. Theory B, 1998

The connectivity of acyclic orientation graphs.

[BibT_eX]

[DOI]

Carla D. Savage

Discret. Math., 1998

1997

Decomposition of the Flow Polynomial.

[BibT_eX]

[DOI]

K. Sekine

Graphs Comb., 1997

Cycles of all lengths in arc-3-cyclic semicomplete digraphs.

[BibT_eX]

[DOI]

Marjorie Darrah

Yi-Ping Liu

Discret. Math., 1997

1996

Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups.

[BibT_eX]

[DOI]

Brian Alspach

Yi-Ping Liu

SIAM J. Discret. Math., 1996

On embeddings of graphs containing no K5-minor.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Nowhere-zero 4-flows and cycle double covers.

[BibT_eX]

[DOI]

Discret. Math., 1996

1995

Hamiltonian weights and unique 3-edge-colorings of cubic graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

1994

Edge-maximal (k, i)-graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1994

Small Circuit Double Covers of Cubic Multigraphs.

[BibT_eX]

[DOI]

Xingxing Yu

J. Comb. Theory B, 1994

1993

Parity Subgraph, Shortest Cycle Cover and Postman Tour.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1993

Cycle covers of cubic multigraphs.

[BibT_eX]

[DOI]

Brian Alspach

Discret. Math., 1993

1992

Factorizations of regular graphs.

[BibT_eX]

[DOI]

Yongjin Zhu

J. Comb. Theory B, 1992

Nowhere-zero 3-flows of highly connected graphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

1991

Cycles through three vertices in 2-connected graphs.

[BibT_eX]

[DOI]

Stephen C. Locke

Graphs Comb., 1991

Long path connectivity of regular graphs.

[BibT_eX]

[DOI]

Yongjin Zhu

Discret. Math., 1991

Cycle cover theorems and their applications.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

1990

Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

Minimum cycle coverings and integer flows.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

1989

Circumference and girth.

[BibT_eX]

[DOI]

J. Graph Theory, 1989

Cycles of given length in some K1, 3-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 1989

Bridges of longest cycles.

[BibT_eX]

[DOI]

Discret. Math., 1989

1988

Hamilton cycles in claw-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1988

1987

Longest cycles and their chords.

[BibT_eX]

[DOI]

J. Graph Theory, 1987

1984

Optimal alphabetic binary tree for a nonregular cost function.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1984

1983

A class of hypergraphs satisfying an inequality of Lovász.

[BibT_eX]

[DOI]

Weixuan Li

J. Comb. Theory B, 1983

1982

Cycles of each length in tournaments.

[BibT_eX]

[DOI]

Tian Feng

Zheng-Sheng Wu

J. Comb. Theory B, 1982

Arc-disjoint circuits in digraphs.

[BibT_eX]

[DOI]