✦ LIBER ✦

A note on a conjecture of Wintner and its disproof by Waldvogel

✍ Scribed by J. S. Griffith

Publisher: Springer Netherlands
Year: 1973
Tongue: English
Weight: 378 KB
Volume: 7
Category: Article
ISSN: 1572-9478
DOI: 10.1007/bf01227852

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note concerning a conjecture by A. Wintn

Note concerning a conjecture by A. Wintner

✍ J. Waldvogel 📂 Article 📅 1972 🏛 Springer Netherlands 🌐 English ⚖ 254 KB

A note on a conjecture of Borwein and Ch

A note on a conjecture of Borwein and Choi

✍ R. Thangadurai 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 254 KB

Note on a conjecture of Kojima and Saiga

Note on a conjecture of Kojima and Saigal

✍ Alan J. Hoffman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 100 KB

Note on a Conjecture of Gopakumar-Vafa

✍ Jun Li*; Baosen Wu 📂 Article 📅 2006 🏛 Coastal and Estuarine Research Federation 🌐 English ⚖ 326 KB

A note on possible extensions of Negami'

A note on possible extensions of Negami's conjecture

✍ Hlin?n�, Petr 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 239 KB 👁 2 views

A graph H is a cover of a graph G, if there exists a mapping ϕ from V (H) onto V (G) such that for every vertex v of G, ϕ maps the neighbors of v in H bijectively onto the neighbors of ϕ(v) in G. Negami conjectured in 1987 that a connected graph has a finite planar cover if and only if it embeds in

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