摘要
In 1983, Bouchet proposed a conjecture that every flow-admissible signed graph admits a nowhere-zero 6-flow. Bouchet himself proved that such signed graphs admit nowhere-zero 216-flows and Zýka further proved that such signed graphs admit nowhere-zero 30-flows. In this paper we show that every flow-admissible signed graph admits a nowhere-zero 11-flow.
源语言 | 英语 |
---|---|
页(从-至) | 198-221 |
页数 | 24 |
期刊 | Journal of Combinatorial Theory. Series B |
卷 | 149 |
DOI | |
出版状态 | 已出版 - 7月 2021 |
已对外发布 | 是 |
指纹
探究 'Flows on flow-admissible signed graphs' 的科研主题。它们共同构成独一无二的指纹。引用此
DeVos, M., Li, J., Lu, Y., Luo, R., Zhang, C. Q., & Zhang, Z. (2021). Flows on flow-admissible signed graphs. Journal of Combinatorial Theory. Series B, 149, 198-221. https://doi.org/10.1016/j.jctb.2020.04.008