✦ LIBER ✦

A proof of McKee's eulerian-bipartite characterization

✍ Scribed by D.R. Woodall

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 248 KB
Volume: 84
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90380-z

No coin nor oath required. For personal study only.

✦ Synopsis

A proof is given of the result about binary matroids that implies that a connected graph is Eulerian if and only if every edge lies in an odd number of circuits, and a graph is bipartite if and only if every edge lies in an odd number of cocircuits (minimal cutsets). A proof is also given of the result that the edge set of every graph can be expressed as a disjoint union of circuits and cocircuits. No matroid theory is assumed.

📜 SIMILAR VOLUMES

A Short Proof of Guenin's Characterizati

A Short Proof of Guenin's Characterization of Weakly Bipartite Graphs

✍ Alexander Schrijver 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 79 KB

We give a proof of Guenin's theorem characterizing weakly bipartite graphs by not having an odd-K 5 minor. The proof curtails the technical and case-checking parts of Guenin's original proof.

Proof of a conjecture on cycles in a bip

Proof of a conjecture on cycles in a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 2 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k ≥ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n ≥ 3k, i.e., M (k) ≤ 3k. W

Elementary proof of a counting formula f

Elementary proof of a counting formula for acyclic bipartite tournaments

✍ C. C. Rousseau 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

A Characterization of Weakly Bipartite G

A Characterization of Weakly Bipartite Graphs

✍ Bertrand Guenin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 889 KB

A signed graph is said to be weakly bipartite if the clutter of its odd circuits is ideal.

A proof of Fulkerson's characterization

A proof of Fulkerson's characterization of permutation matrices

✍ Allan B. Cruse 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 467 KB

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.