2 citations · 5 across the 6 of their papers we have counts for
8 papers
Decomposition of class II graphs into two class I graphs
Yan Cao, Guangming Jing, Rong Luo +3
Mkrtchyan and Steffen [J. Graph Theory, 70 (4), 473--482, 2012] showed that every class II simple graph can be decomposed into a maximum -edge-colorable subgraph and a matching.…
Flows of 3-edge-colorable cubic signed graphs
Liangchen Li, Chong Li, Rong Luo +2
Bouchet conjectured in 1983 that every flow-admissible signed graph admits a nowhere-zero 6-flow which is equivalent to the restriction to cubic signed graphs. In this paper, we pr…
The Automatic Quasi-clique Merger algorithm (AQCM)
Scott Payne, Edgar Fuller, George Spirou +1
The Automatic Quasi-clique Merger algorithm is a new algorithm adapted from early work published under the name QCM (quasi-clique merger) [Ou2006, Ou2007, Zhao2011, Qi2014]. The AQ…
Edge-cuts Optimized for Average Weight: a new alternative to Ford and Fulkerson
Scott Payne, Edgar Fuller, Cun-Quan Zhang
Let be a directed graph associated with a weight . For an edge-cut of , the average weight of is denoted and defined as $w_{ave}(Q)=\frac{\s…
Wiener index of unicycle graphs with given number of even degree vertices
Peter Luo, Cun-Quan Zhang, Xiao-Dong Zhang
The Wiener index of a connected graph is the sum of the distance of all pairs of distinct vertices. It was introduced by Wiener in 1947 to analyze some aspects of branching by fitt…
Flows on signed graphs without long barbells
You Lu, Rong Luo, Michael Schubert +2
Many basic properties in Tutte's flow theory for unsigned graphs do not have their counterparts for signed graphs. However, signed graphs without long barbells in many ways behave…