Vector spaces and the Petersen graph (Q1010714)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5540914
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vector spaces and the Petersen graph |
scientific article; zbMATH DE number 5540914 |
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
0 references
0.90035695
0 references
0.9003386
0 references
0 references
0.8925695
0 references
