Skip to main content
SpringerLink
Log in

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

  • NOTE
  • Published:
Combinatorica Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Istituto di Analisi dei Sistemi ed Informatica – CNR; Viale Manzoni 30, 00185 Roma, Italy; E-mail: galluccio@iasi.rm.cnr.it, , , , , , IT

    Anna Galluccio

  2. Department of Mathematics and Statistics, Simon Fraser University; 8888 University Drive Burnaby, BC V5A 1S6, Canada; E-mail: goddyn@math.sfu.ca, , , , , , CA

    Luis A. Goddyn

Authors
  1. Anna Galluccio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luis A. Goddyn
    View author publications

    You can also search for this author in PubMed Google Scholar

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

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930200025

Search

Navigation