Skip to main content
Log in

On Circular Flows Of Graphs

  • NOTE
  • Published:
Combinatorica Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

A sufficient condition for graphs with circular flow index less than 4 is found in this paper. In particular, we give a simple proof of a result obtained by Galluccio and Goddyn (Combinatorica, 2002), and obtain a larger family of such graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hong-Jian Lai.

Additional information

* Partially supported by the National Security Agency under Grants MDA904-01-1-0022.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lai, HJ., Xu, R. & Zhang*, CQ. On Circular Flows Of Graphs. Combinatorica 27, 245–246 (2007). https://doi.org/10.1007/s00493-007-0055-0

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-007-0055-0

Mathematics Subject Classification (2000):