✦ LIBER ✦

On characterizations of binary and graphic matroids

✍ Scribed by Jean-Paul Doignon

Book ID: 107748380
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 218 KB
Volume: 37
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90229-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Mighton's characterization of graphic

On Mighton's characterization of graphic matroids

✍ Donald K. Wagner 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 110 KB

Chordal characterization of graphic matr

Chordal characterization of graphic matroids

✍ Wiktor Piotrowski 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 722 KB

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

On Tutt's Characterization of graphic ma

On Tutt's Characterization of graphic matroids—a graphic proof

✍ A. M. H. Gerards 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB

## 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.

ℓ-matrices and a characterization of bin

ℓ-matrices and a characterization of binary matroids

✍ Robert E. Bixby 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 566 KB

1+ Introductim ## 2. &tnatrsids An Z-nt~rfpis is 8 @-I matrix having thk. I+ 7 .Fyaty tha? some permuta-tion of its distinct ~ofutnns is the matrix J: I,\* fair some intttgcr r 2 '1. JP is the r \* r matrix of all 1's and lr is thbz F X r identity. Given an [-maitrix with r rows. the follc:wing pr

Fundamental circuits and a characterizat

Fundamental circuits and a characterization of binary matroids

✍ Michel Las Vergnas 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 84 KB

Characterizing 3-connected planar graphs

Characterizing 3-connected planar graphs and graphic matroids

✍ Manoel Lemos; Talmage James Reid; Haidong Wu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

## Abstract A well‐known result of Tutte states that a 3‐connected graph __G__ is planar if and only if every edge of __G__ is contained in exactly two induced non‐separating circuits. Bixby and Cunningham generalized Tutte's result to binary matroids. We generalize both of these results and give n