𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A characterization of PM-compact bipartite and near-bipartite graphs

✍ Scribed by Wang, Xiumei; Lin, Yixun; Carvalho, Marcelo H.; Lucchesi, Cláudio L.; Sanjith, G.; Little, C.H.C.

Book ID
118735682
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
446 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 Characterisation of Pfaffian Near Bipa
A Characterisation of Pfaffian Near Bipartite Graphs
✍ Ilse Fischer; Charles H.C. Little 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 622 KB

A graph is 1-extendible if every edge has a 1-factor containing it. A 1-extendible non-bipartite graph G is said to be near bipartite if there exist edges e 1 and e 2 such that G&[e 1 , e 2 ] is 1-extendible and bipartite. We characterise the Pfaffian near bipartite graphs in terms of forbidden subg

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.