Flows of 3-edge-colorable cubic signed graphs

European Journal of Combinatorics(2023)

引用 0|浏览6
暂无评分
摘要
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 proved that every flow-admissible 3-edge-colorable cubic signed graph admits a nowhere-zero 10-flow. This together with the 4-color theorem implies that every flow-admissible bridgeless planar signed graph admits a nowhere-zero 10-flow. As a byproduct, we also show that every flow-admissible hamiltonian signed graph admits a nowhere-zero 8-flow.
更多
查看译文
关键词
graphs,flows,edge-colorable
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要