Rong Luo

collaborators

3 papers

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 $…

An 8-flow theorem for signed graphs

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

Integer flows on triangularly connected signed graphs

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