✦ LIBER ✦

Cycles in bipartite graphs

✍ Scribed by Bill Jackson

Book ID: 107884133
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 423 KB
Volume: 30
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(81)90050-2

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

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

Long cycles in unbalanced bipartite grap

Long cycles in unbalanced bipartite graphs

✍ Shuya Chiba; Jun Fujisawa; Masao Tsugaki; Tomoki Yamashita 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 222 KB

Balanced cycles and holes in bipartite g

Balanced cycles and holes in bipartite graphs

✍ Michele Conforti; Gérard Cornuéjols; Kristina Vušković 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 414 KB

Bruce Reed asks the following question: Can we determine whether a bipartite graph contains a chordless cycle whose length is a multiple of 4? We show that the two following more general questions are equivalent and we provide an answer. Given a bipartite graph G where each edge is assigned a weight

Dominating cycles in bipartite biclaw-fr

Dominating cycles in bipartite biclaw-free graphs

✍ Daniel Barraez; Evelyne Flandrin; Hao Li; Oscar Ordaz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Flandrin et ai. (to appear) define a simple bipartite graph to be biclaw-free if it contains no induced subgraph isomorphic to H, where H could be obtained from two copies of K1.3 by adding an edge joining the two vertices of degree 3. They have shown that if G is a bipartite, balanced, biclaw-free