✦ LIBER ✦

Long cycles in unbalanced bipartite graphs

✍ Scribed by Shuya Chiba; Jun Fujisawa; Masao Tsugaki; Tomoki Yamashita

Book ID: 113567618
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 222 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.02.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Long cycles in bipartite graphs

✍ Bill Jackson 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 735 KB

Cycles in bipartite graphs

✍ Bill Jackson 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Extending cycles in bipartite graphs

✍ George R.T Hendry 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 891 KB

Hamiltonian cycles in bipartite graphs

✍ Xiaoyun Lu 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 389 KB

On long cycles in a 2-connected bipartit

On long cycles in a 2-connected bipartite graph

✍ Hong Wang 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 822 KB

Intersection Representation of Complete

Intersection Representation of Complete Unbalanced Bipartite Graphs

✍ Nancy Eaton 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 282 KB

A p-intersection representation of a graph G is a map, f, that assigns each vertex a subset of [1, 2, ..., t] The symbol % p (G) denotes this minimum t such that a p-intersection representation of G exists. In 1966 Erdo s, Goodman, and Po sa showed that for all graphs G on 2n vertices, % 1 (G) % 1