Skip to main content
2 of 13
deleted 20 characters in body
Honza
  • 439
  • 2
  • 10

Co-trees of a simple graph

Consider fundamental cycles of a specific spanning tree of a simple graph. I would like to prove:

Any co-tree of the graph corresponds to a unique selection of exactly one edge from each of these cycles.

Honza
  • 439
  • 2
  • 10