✦ LIBER ✦

Nested bipartite graphs

✍ Scribed by Franz Hering

Book ID: 112888988
Publisher: The Hebrew University Magnes Press
Year: 1971
Tongue: English
Weight: 548 KB
Volume: 9
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02771691

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing bipartite graphs with covers of

Packing bipartite graphs with covers of complete bipartite graphs

✍ Chalopin, Jérémie; Paulusma, Daniël 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Bipartite Graphs, Hamiltonicity and grap

Bipartite Graphs, Hamiltonicity and graphs

✍ Rahman, M. Sohel; Kaykobad, M.; Kaykobad, Md. Tanvir 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Nearly bipartite graphs

✍ E. Győri; V. Nikiforov; R.H. Schelp 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Bipartite-Perfect Graphs

✍ Van Bang Le 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 91 KB

Graphoidal bipartite graphs

✍ S. Arumugam; C. Pakkiam 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 283 KB

Packing bipartite graphs

✍ A. Pawel Wojda; Paul Vaderlind 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 383 KB

For two bipartite graphs G = (L, R; E) and G' = (L', R'; E') a bijection f: LwR --\* L'uR' such that f(L) = L' is called hi-placement when f(u)f(v)~E', for every edge uv ~ E (then G and G' are called hi-placeable). We give new sufficient conditions for bipartite graphs G and G' to be bi-placeable.