Nowhere-zero 3-flows in triangularly connected graphs

  • Authors:

  • Genghua Fan;Hongjian Lai;Rui Xu;Cun-Quan Zhang;Chuixiang Zhou

  • Affiliations:

  • Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian 350002, China;Department of Mathematics, West Virginia University, Morgantown, WV 26506-6310, USA;Department of Mathematics, University of West Georgia, Carrollton, GA 30118, USA;Department of Mathematics, West Virginia University, Morgantown, WV 26506-6310, USA;Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian 350002, China

  • Venue:
  • Journal of Combinatorial Theory Series B
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let H"1 and H"2 be two subgraphs of a graph G. We say that G is the 2-sum of H"1 and H"2, denoted by H"1@?"2H"2, if E(H"1)@?E(H"2)=E(G), |V(H"1)@?V(H"2)|=2, and |E(H"1)@?E(H"2)|=1. A triangle-path in a graph G is a sequence of distinct triangles T"1T"2...T"m in G such that for 1=i+1. A connected graph G is triangularly connected if for any two edges e and e^', which are not parallel, there is a triangle-path T"1T"2...T"m such that e@?E(T"1) and e^'@?E(T"m). Let G be a triangularly connected graph with at least three vertices. We prove that G has no nowhere-zero 3-flow if and only if there is an odd wheel W and a subgraph G"1 such that G=W@?"2G"1, where G"1 is a triangularly connected graph without nowhere-zero 3-flow. Repeatedly applying the result, we have a complete characterization of triangularly connected graphs which have no nowhere-zero 3-flow. As a consequence, G has a nowhere-zero 3-flow if it contains at most three 3-cuts. This verifies Tutte's 3-flow conjecture and an equivalent version by Kochol for triangularly connected graphs. By the characterization, we obtain extensions to earlier results on locally connected graphs, chordal graphs and squares of graphs. As a corollary, we obtain a result of Barat and Thomassen that every triangulation of a surface admits all generalized Tutte-orientations.