The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four

We show that every 6-edge connected graph admits a circulation whose range lies in the interval [1,3).

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received March 29, 2000

RID="*"

ID="*" Supported by NATO-CNR Fellowship; this work was done while the author was visiting the Dept. of Mathematics and Statistics at Simon Fraser University, Canada.

RID="†"

ID="†" Supported by a National Sciences and Engineering Research Council Research Grant

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Galluccio, A., Goddyn, L. The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four. Combinatorica 22, 455–459 (2002). https://doi.org/10.1007/s004930200025

Download citation

  • AMS Subject Classification (2000) Classes:  05C70, 90B10, 90C35