✦ LIBER ✦

A Remark on a Graph-Covering Conjecture of D. R. Woodall

✍ Scribed by Zelinka, B.

Book ID: 120097741
Publisher: Oxford University Press
Year: 1973
Tongue: English
Weight: 46 KB
Volume: s2-6
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-6.4.637

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Conjecture of Woodall

✍ Hao Li 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Dirac proved in 1952 that every 2-connected graph of order n and minimum degree k admits a cycle of length at least minfn; 2kg: As a possible improvement, Woodall conjectured in 1975 that if a 2-connected graph of order n has at least n 2 þ k vertices of degree at least k; then it has a cycle of len

A remark on covering graphs

✍ Pavel Holub 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 111 KB

A remark on Donovan’s conjecture

✍ R. Kessar 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 66 KB

Note on a min-max conjecture of Woodall

✍ Orlando Lee; Yoshiko Wakabayashi 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 78 KB

## Abstract In 1978 Woodall [6] conjectured the following: in a planar digraph the size of a shortest cycle is equal to the maximum cardinality of a collection of disjoint tranversals of cycles. We prove that this conjecture is true when the digraph is series‐parallel. In fact, we prove a stronger

A remark on a conjecture of Seifert

✍ Hsin Chu 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 524 KB

A remark on Mulder's conjecture about in

A remark on Mulder's conjecture about interval-regular graphs

✍ K. Nomura 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Let F be a connected graph. F is said to be interval-regular if I F~\_ l(u) uF(x )J =. i holds for all vertices u and x ~ Fi(u), i > 0. For u, v e F, let I (u, v) denote the set of all vertices on a shortest path connecting u, v. A subset W of V(F) is said to be convex if l(u,v) c W holds for each u