๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Elementary proofs of (relatively) recent characterizations of Eulerian graphs

โœ Scribed by Herbert Fleischner

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
198 KB
Volume
24
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A proof of McKee's eulerian-bipartite ch
A proof of McKee's eulerian-bipartite characterization
โœ D.R. Woodall ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 248 KB

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 res

A proof of a circle graph characterizati
A proof of a circle graph characterization
โœ Emmanuel Gasse ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 266 KB

A circle graph is an intersection graph of a non-empty finite set of chords of a circle. By using a theorem of Bouchet, we redemonstrate easily a result obtained by Naji which characterizes circle graphs by resolving a system of linear equations of GF(2). The graphs that we consider are simple. A g

A simple proof of the characterization o
A simple proof of the characterization of antipodal graphs
โœ Garry Johns ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 88 KB

The antipodal graph A(G) of a graph G is defined as the graph on the same vertex set as G with two vertices being adjacent in A(G) if the distance between them in G is the diameter of G. (If G is disconnected then we define &am(G) = co.) Aravamudhan and Rajendran [l, 21 gave the following character

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.