Elsevier

Discrete Mathematics

Volume 110, Issues 1–3, 11 December 1992, Pages 179-183
Discrete Mathematics

Nowhere-zero 3-flows of highly connected graphs

https://doi.org/10.1016/0012-365X(92)90706-LGet rights and content
Under an Elsevier user license
open archive

Abstract

Let G be a k-edge-connected graph of order n. If k⩾4⌈log2 n⌉ then G has a nowhere-zero 3-flow.

Cited by (0)

The research of this author was partially supported by National Science Foundation under the grant DMS-8906973.