✦ LIBER ✦

Long cycles in bipartite graphs

✍ Scribed by Bill Jackson

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 735 KB
Volume: 38
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(85)90077-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian cycles in bipartite graphs

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

Long cycles in bipartite tournaments

✍ Jianzhong Wang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 318 KB

A digraph D is said to satisfy the condition O(n) ifd~-(u) + d r (v) >t n whenever uv is not an arc of D. In this paper we prove the following results: If a p x q bipartite tournament T is strong and satisfies O(n), then T contains a cycle of length at least min(2n + 2, 2p, 2q}, unless T is isomorph

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

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

Longest paths and cycles in bipartite or

Longest paths and cycles in bipartite oriented graphs

✍ Zhang Ke Min 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 430 KB 👁 1 views

In this paper we obtain two sufficient conditions, Ore type (Theorem 1) and Dirac type (Theorem 2). on the degrees of a bipartite oriented graph for ensuring the existence of long paths and cycles. These conditions are shown to be the best possible in a sense. An oriented graph is a digraph without

Spanning Cycles Through Specified Edges

Spanning Cycles Through Specified Edges in Bipartite Graphs

✍ Reza Zamani; Douglas B. West 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB

P ósa proved that if G is an n-vertex graph in which any two nonadjacent vertices have degree-sum at least n+k, then G has a spanning cycle containing any specified family of disjoint paths with a total of k edges. We consider the analogous problem for a bipartite graph G with n vertices and parts o