Elementary strong maps of graphic matroids
✍ Scribed by András Recski
- Book ID
- 105309460
- Publisher
- Springer Japan
- Year
- 1987
- Tongue
- English
- Weight
- 234 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper we present the characterization of graphic matroids using the concept of a chord. Then we apply this characterization to solve a problem of Szamkolowicz [9]. One of the deepest theorems in the theory of matroids is Tuttes excludedminor characterization of graphic matroids [ 111. The p
## Abstract In this paper we present a relatively simple proof of Tutt's characterization of graphic matroids. The proof uses the notion of ‘signed graph’ and it is ‘graphic’ in the sense that it can be presented almost entirely by drawing (signed) graphs. © 1995 John Wiley & Sons, Inc.