✦ LIBER ✦

On long cycles in a 2-connected bipartite graph

✍ Scribed by Hong Wang

Publisher: Springer Japan
Year: 1996
Tongue: English
Weight: 822 KB
Volume: 12
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01858470

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

Hamilton Cycles in 2-Connected Regular B

Hamilton Cycles in 2-Connected Regular Bipartite Graphs

✍ B. Jackson; H. Li 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 671 KB

On Independent Cycles in a Bipartite Gra

On Independent Cycles in a Bipartite Graph

✍ Hong Wang 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 104 KB

Long Cycles in 3-Connected Graphs

✍ Guantao Chen; Xingxing Yu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 249 KB

Moon and Moser in 1963 conjectured that if G is a 3-connected planar graph on n vertices, then G contains a cycle of length at least Oðn log 3 2 Þ: In this paper, this conjecture is proved. In addition, the same result is proved for 3-connected graphs embeddable in the projective plane, or the torus

Proof of a conjecture on cycles in a bip

Proof of a conjecture on cycles in a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 2 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k ≥ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n ≥ 3k, i.e., M (k) ≤ 3k. W

Large Vertex-Disjoint Cycles in a Bipart

Large Vertex-Disjoint Cycles in a Bipartite Graph

✍ Hong Wang 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 100 KB