✦ LIBER ✦

On the intersections of circuits and cocircuits in matroids

✍ Scribed by James G. Oxley

Book ID: 110564269
Publisher: Springer-Verlag
Year: 1984
Tongue: English
Weight: 469 KB
Volume: 4
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579220

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Intersections of circuits and cocircuits

Intersections of circuits and cocircuits in binary matroids

✍ S.R. Kingan 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 493 KB

Circuits and Cocircuits in Regular Matro

Circuits and Cocircuits in Regular Matroids

✍ Dillon Mayhew 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 115 KB

On the Circuit-cocircuit Intersection Co

On the Circuit-cocircuit Intersection Conjecture

✍ S. R. Kingan; Manoel Lemos 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 121 KB

On the Cocircuit Graph of an Oriented Ma

On the Cocircuit Graph of an Oriented Matroid

✍ Cordovil, R.; Fukuda, K.; Guedes de Oliveira, A. 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 76 KB

On elements in small cocircuits in minim

On elements in small cocircuits in minimally k-connected graphs and matroids

✍ Talmage James Reid; Haidong Wu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 107 KB

On removable circuits in graphs and matr

On removable circuits in graphs and matroids

✍ Lemos, Manoel; Oxley, James 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 283 KB

Mader proved that every 2-connected simple graph G with minimum degree d exceeding three has a cycle C, the deletion of whose edges leaves a 2-connected graph. Jackson extended this by showing that C may be chosen to avoid any nominated edge of G and to have length at least d-1. This article proves