Vector spaces and the Petersen graph (Q1010714): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 22:11, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Vector spaces and the Petersen graph |
scientific article |
Statements
Vector spaces and the Petersen graph (English)
0 references
7 April 2009
0 references
Summary: It is shown that a matching covered graph has an ear decomposition with no more than one double ear if and only if there is no set \(S\) of edges such that \(|S \cap A|\) is even for every alternating circuit \(A\) but \(|S \cap C|\) is odd for some even circuit \(C\). Two proofs are presented. The first uses vector spaces and the second is constructive. Some applications are also given.
0 references
matching covered graph
0 references
ear decomposition
0 references