期刊文献+

Nowhere-zero 15-Flow in 3-Edge-connected Bidirected Graphs

Nowhere-zero 15-Flow in 3-Edge-connected Bidirected Graphs
原文传递
导出
摘要 It was conjectured by Bouchet that every bidirected graph which admits a nowhere-zero κ flow will admit a nowhere-zero 6-flow. He proved that the conjecture is true when 6 is replaced by 216. Zyka improved the result with 6 replaced by 30. Xu and Zhang showed that the conjecture is true for 6-edge-connected graphs. And for 4-edge-connected graphs, Raspaud and Zhu proved it is true with 6 replaced by 4. In this paper, we show that Bouchet's conjecture is true with 6 replaced by 15 for 3-edge-connected graphs. It was conjectured by Bouchet that every bidirected graph which admits a nowhere-zero κ flow will admit a nowhere-zero 6-flow. He proved that the conjecture is true when 6 is replaced by 216. Zyka improved the result with 6 replaced by 30. Xu and Zhang showed that the conjecture is true for 6-edge-connected graphs. And for 4-edge-connected graphs, Raspaud and Zhu proved it is true with 6 replaced by 4. In this paper, we show that Bouchet's conjecture is true with 6 replaced by 15 for 3-edge-connected graphs.
出处 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2014年第4期649-660,共12页 数学学报(英文版)
基金 Supported by the Fundamental Research Funds for the Central Universities the Research Funds of Renmin University of China Project(Grant No.10XNB054)
关键词 Bidirected graph integer flow signed graph Bidirected graph, integer flow, signed graph
  • 相关文献

参考文献12

  • 1Bouchet, A.: Nowhere-zero integer flows on bidirected graphs. J. Combin. Theory Ser. B, 34, 279-292 (1983).
  • 2Jaeger, F.: Flows and generalized coloring theorems in graphs. J. Combin. Theory Ser. B, 26, 205-216 (1979).
  • 3Khelladi, A.: Nowhere-zero integer chains and flows in bidirected graphs. J. Combin. Theory Set. B, 43, 95-115 (1987).
  • 4Korte, B., Vygen, J.: Combinatorial Optimization Theory and Algorithms, Springer, Berlin, 2006.
  • 5Raspaud, A., Zhu, X.: Circular flow on signed graphs. J. Combin. Theory Ser. B, 101, 464-479 (2011).
  • 6Seymour, P. D.: Nowhere-zero 6-flows. J. Combin. Theory Ser. B, 30, 130-135 (1981).
  • 7Thomassen, C.: 2-1inked graphs. Europ. J. Combinatorics, 1, 371-378 (1980).
  • 8Tort, B., Jensen, T. R.: Graph Coloring Problems, Wiley, New York, 1995.
  • 9Tutte, W. T.: On the imbedding of linear graphs in surfaces. Proc. London Math. Soc., 51,474-483 (1949).
  • 10Wei, E., Tang, W., Wang, X.: Flows in 3-edge-connected bidirected graphs. Front. Math. China, 6, 339-348 (2011).

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部