✦ LIBER ✦

A Characterization of Weakly Bipartite Graphs

✍ Scribed by Bertrand Guenin

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 889 KB
Volume: 83
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.2001.2051

No coin nor oath required. For personal study only.

✦ Synopsis

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

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

A characterization of weakly four-connec

A characterization of weakly four-connected graphs

✍ Tibor Jordán 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## Abstract A graph __G__ = (__V__, __E__) is called weakly four‐connected if __G__ is 4‐edge‐connected and __G__ − __x__ is 2‐edge‐connected for all __x__ ∈ __V__. We give sufficient conditions for the existence of ‘splittable’ vertices of degree four in weakly four‐connected graphs. By using thes

Packing two bipartite graphs into a comp

Packing two bipartite graphs into a complete bipartite graph

✍ Wang, Hong 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 3 views

For two integers a and b, we say that a bipartite graph G admits an (a, b)bipartition if G has a bipartition (X, Y ) such that |X| = a and |Y | = b. We say that two bipartite graphs G and H are compatible if, for some integers a and b, both G and H admit (a, b)-bipartitions. In this paper, we prove

Embeddings of bipartite graphs

✍ Mohammed Abu-Sbeih; T. D. Parsons 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 458 KB

Bichromaticity of bipartite graphs

✍ Dan Pritikin 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 312 KB

Let 8 be a bipartite graph with edge set €and vertex bipartition M, N. The bichromaticity p ( 6) is defined as the maximum number p such that a complete bipartite graph on p vertices is obtainable from 5 by a sequence of identifications of vertices of M or vertices of N. Let p = max{lMI, IN\}. Hara

On the bipartite independence number of

On the bipartite independence number of a balanced bipartite graph

✍ Odile Favaron; Pedro Mago; Oscar Ordaz 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 603 KB

Venezuela Ap. 47567, Caracas Favaron, O., P. Mago and 0. Ordaz, On the bipartite independence number of a balanced bipartite graph, Discrete Mathematics 121 (1993) 55-63. The bipartite independence number GI aIp of a bipartite graph G is the maximum order of a balanced independent set of G. Let 6 b