In [J Combin Theory Ser B, 26 (1979), 205-216] , Jaeger showed that every graph with 2 edge-disjoint spanning trees admits a nowhere-zero 4-flow. In [J Combin Theory Ser B, 56 (1992), 165-182], Jaeger et al. extended this result by showing that, if A is an abelian group with |A| = 4, then every gra
Nowhere zero 4-flow in regular matroids
✍ Scribed by Hong-Jian Lai; Xiangwen Li; Hoifung Poon
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 96 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
Jensen and Toft 8 conjectured that every 2‐edge‐connected graph without a K~5~‐minor has a nowhere zero 4‐flow. Walton and Welsh 19 proved that if a coloopless regular matroid M does not have a minor in {M(K~3,3~), M*(K~5~)}, then M admits a nowhere zero 4‐flow. In this note, we prove that if a coloopless regular matroid M does not have a minor in {M(K~5~), M*(K~5~)}, then M admits a nowhere zero 4‐flow. Our result implies the Jensen and Toft conjecture. © 2005 Wiley Periodicals, Inc. J Graph Theory
📜 SIMILAR VOLUMES
A nowhere-zero 3-flow in a graph G is an assignment of a direction and a value of 1 or 2 to each edge of G such that, for each vertex v in G, the sum of the values of the edges with tail v equals the sum of the values of the edges with head v. Motivated by results about the region coloring of planar
Let G be a 2-edge-connected simple graph with order n. We show that if IV(G)l 5 17, then either G has a nowhere-zero 4-flow, or G is contractible to the Petersen graph. We also show that for n large, if I€(G)J L (' 2 17) + 34, then either G has a nonwhere-zero 4-flow, or G can be contracted to the P
## Abstract In this paper, we characterize graphs whose tensor product admit nowhere‐zero 3‐flow. The main result is: For two graphs __G__~1~ and __G__~2~ with δ ≥ 2 and __G__~2~ not belonging to a well‐characterized class of graphs, the tensor product of __G__~1~ and __G__~2~ admits a nowhere‐zero
## Abstract Let __G__ be a graph. For each vertex __v__ ∈__V__(__G__), __N~v~__ denotes the subgraph induces by the vertices adjacent to __v__ in __G__. The graph __G__ is locally __k__‐edge‐connected if for each vertex __v__ ∈__V__(__G__), __N~v~__ is __k__‐edge‐connected. In this paper we study t