首页 | 本学科首页   官方微博 | 高级检索  
     


Nowhere-zero 3-flow of graphs with small independence number
Authors:Jiaao Li  Rong Luo  Yi Wang
Affiliation:1. Department of Mathematics, West Virginia University, Morgantown, WV 26506, United States;2. School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou, Jiangsu, 221116, China;3. School of Mathematical Sciences, Anhui University, Hefei, Anhui 230601, China
Abstract:
Tutte’s 3-flow conjecture states that every 4-edge-connected graph admits a nowhere-zero 3-flow. In this paper, we characterize all graphs with independence number at most 4 that admit a nowhere-zero 3-flow. The characterization of 3-flow verifies Tutte’s 3-flow conjecture for graphs with independence number at most 4 and with order at least 21. In addition, we prove that every odd-5-edge-connected graph with independence number at most 3 admits a nowhere-zero 3-flow. To obtain these results, we introduce a new reduction method to handle odd wheels.
Keywords:Integer flows  Group connectivity  Independence number  Odd edge connectivity  Modulo orientation  Corresponding author at: School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou, Jiangsu, 221116, China.
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号