✦ LIBER ✦

Proof of Moll’s minimum conjecture

✍ Scribed by Chen, William Y.C.; Xia, Ernest X.W.

Book ID: 118744972
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 187 KB
Volume: 34
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2012.11.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proofs of Two Minimum Circuit Cover Conj

Proofs of Two Minimum Circuit Cover Conjectures

✍ Genghua Fan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Let G be a 2-edge-connected graph with m edges and n vertices. The following two conjectures are proved in this paper. (i) The edges of G can be covered by circuits of total length at most m+n&1. (ii) The vertices of G can be covered by circuits of total length at most 2(n&1), where n 2. 1998 Acad

Elementary Proof of MacMahon's Conjectur

Elementary Proof of MacMahon's Conjecture

✍ David M. Bressoud 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 96 KB

A proof of Ehrenfeucht's Conjecture

✍ M.H. Albert; J. Lawrence 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 153 KB

A proof of snevily’s conjecture

✍ Bodan Arsovski 📂 Article 📅 2011 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 157 KB

A proof of Boesch's conjecture

✍ Guifang Wang 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 596 KB

Redfield's proofs of MacMahon's conjectu

Redfield's proofs of MacMahon's conjecture

✍ E.Keith Lloyd 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 767 KB