A signed graph is said to be weakly bipartite if the clutter of its odd circuits is ideal.
β¦ LIBER β¦
A Characterization of Weakly Bipartite Graphs
β Scribed by Bertrand Guenin
- Book ID
- 108498123
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 193 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A Characterization of Weakly Bipartite G
β
Bertrand Guenin
π
Article
π
2001
π
Elsevier Science
π
English
β 889 KB
A Short Proof of Guenin's Characterizati
β
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.
On some weakly bipartite graphs
β
Francisco Barahona
π
Article
π
1983
π
Elsevier Science
π
English
β 396 KB
A characterization of PM-compact biparti
β
Wang, Xiumei; Lin, Yixun; Carvalho, Marcelo H.; Lucchesi, ClΓ‘udio L.; Sanjith, G
π
Article
π
2013
π
Elsevier Science
π
English
β 446 KB
A characterization of bipartite distance
β
Lee, Guang-Siang; Weng, Chih-wen
π
Article
π
2014
π
Elsevier Science
π
English
β 295 KB
Characterizations of bipartite Steinhaus
β
Gerard J. Chang; Bhaskar DasGupta; Wayne M. DymΓ Δek; Martin FΓΌrer; Matthew Koerl
π
Article
π
1999
π
Elsevier Science
π
English
β 821 KB
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion had previously been given for the number of bipartite Steinhaus graphs and we give two fascinating closed forms for this