Rong Luo

activity

20232026

collaborators

5 papers

math.CO2026

Integer Flows on Cyclic Covers of Graphs

Rong Luo, Yuying Ma, D. Christopher Stephens +1

Graph covers preserve the local structure of a graph while allowing its global structure to change substantially. In this paper, we study how such changes in cyclic covers affect n…

math.CO2026

Reduction Operations and Characterizations of $S^{1}$ -Flows in Graphs

Chenxing Li, Jiaao Li, Rong Luo +1

Thomassen (J. Combin. Theory Ser. B 108 (2014), 81-91) showed that every graph admitting a nowhere-zero $3$ -flow also admits an $S^{1}$ -flow. He also proved that the converse holds f…

math.CO2024

An 8-flow theorem for signed graphs

Rong Luo, Edita Máčajová, Martin Škoviera +1

We prove that a signed graph admits a nowhere-zero $8$ -flow provided that it is flow-admissible and the underlying graph admits a nowhere-zero $4$ -flow. When combined with the 4-co…

math.CO2023

Signed circuit $6$ -covers of signed $K_{4}$ -minor-free graphs

You Lu, Rong Luo, Zhengke Miao +1

Bermond, Jackson and Jaeger [{\em J. Combin. Theory Ser. B} 35 (1983): 297-308] proved that every bridgeless ordinary graph $G$ has a circuit $4$ -cover and Fan [{\em J. Combin. The…

math.CO2023

Integer flows on triangularly connected signed graphs

Liangchen Li, Chong Li, Rong Luo +1

A triangle-path in a graph $G$ is a sequence of distinct triangles $T_{1}, T_{2}, \dots, T_{m}$ in $G$ such that for any $i, j$ with $1 \leq i < j \leq m$ , $∣ E (T_{i}) \cap E (T_{i + 1}) ∣ = 1$ and $…

Integer Flows on Cyclic Covers of Graphs

Reduction Operations and Characterizations of S1-Flows in Graphs

An 8-flow theorem for signed graphs

Signed circuit 6-covers of signed K4​-minor-free graphs

Integer flows on triangularly connected signed graphs

Reduction Operations and Characterizations of $S^{1}$ -Flows in Graphs

Signed circuit $6$ -covers of signed $K_{4}$ -minor-free graphs