✦ LIBER ✦

How to make a graph bipartite

✍ Scribed by Paul Erdös; Ralph Faudree; János Pach; Joel Spencer

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 678 KB
Volume: 45
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(88)90057-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

How to make a graph four-connected

✍ Ervin Győri; Tibor Jordán 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 92 KB

Note making aK4-free graph bipartite

✍ Benny Sudakov 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 177 KB

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

How To Make A Miracle

✍ Atiyah, Joe 📂 Fiction 📅 0 🌐 und ⚖ 2 KB

How to Make a Shoe

✍ Headley, Jno P 📂 Fiction 🌐 English ⚖ 1 MB

How to Guard a Graph?

✍ Fedor V. Fomin; Petr A. Golovach; Alex Hall; Matúš Mihalák; Elias Vicari; Peter 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 611 KB