On theories of Whitney and Tutte (Q1070237)
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 3935059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On theories of Whitney and Tutte |
scientific article; zbMATH DE number 3935059 |
Statements
On theories of Whitney and Tutte (English)
0 references
1985
0 references
By making extensive use of connectivity properties of graphs the author gives new proofs of the following classical results: (1) For nonseparable graphs G, G' the cycle matroids M(G) and M(G') are isomorphic iff G and G' are 2-isomorphic (Whitney); (2) A binary matroid M is graphic iff none of \(F_ 7\), \(F_ 7^*\), \(M^*(K_ 5)\) and \(M^*(K_{3,3})\) is a minor of M (Tutte). The proofs are simpler and shorter and such lend themselves for use in introductory courses on this subject.
0 references
graphic matroid
0 references
connectivity properties of graphs
0 references
cycle matroids
0 references
0.8138436079025269
0 references
0.812839925289154
0 references
0.7901780605316162
0 references
