On the Cycle Space of a 3--Connected Graph

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We give a simple proof of Tutte's theorem stating that the cycle space of a
3--connected graph is generated by the set of non-separating circuits of the
graph.
Keywords: graph, cycle, circuit, cycle space, non-separating circuit, strong
isomorphism.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the Cycle Space of a 3--Connected Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Cycle Space of a 3--Connected Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Cycle Space of a 3--Connected Graph will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-112631

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.