An 8-flow theorem for signed graphs
Combinatorics
2024-02-21 v1
Abstract
We prove that a signed graph admits a nowhere-zero -flow provided that it is flow-admissible and the underlying graph admits a nowhere-zero -flow. When combined with the 4-color theorem, this implies that every flow-admissible bridgeless planar signed graph admits a nowhere-zero -flow. Our result improves and generalizes previous results of Li et al. (European J. Combin. 108 (2023), 103627), which state that every flow-admissible signed -edge-colorable cubic graph admits a nowhere-zero -flow, and that every flow-admissible signed hamiltonian graph admits a nowhere-zero -flow.
Keywords
Cite
@article{arxiv.2402.12883,
title = {An 8-flow theorem for signed graphs},
author = {Rong Luo and Edita Máčajová and Martin Škoviera and Cun-Quan Zhang},
journal= {arXiv preprint arXiv:2402.12883},
year = {2024}
}
Comments
12 pages, 2 figures