File:Graphic matroid parity.svg
Summary
| Description |
English: An instance of the matroid parity problem on a graphic matroid: given a graph with colored edges, having exactly two edges per color, find as large a forest as possible that again has exactly two edges per color. |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
  |
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
