𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A proof of two conjectures of Deveci and Karaduman

✍ Scribed by Hiller, Josh


Book ID
122213269
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
175 KB
Volume
446
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Proofs of Two Minimum Circuit Cover Conj
✍ 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

A Proof of Simmons' Conjecture
✍ Tor Helleseth; Johannes Mykkeltveit πŸ“‚ Article πŸ“… 2004 πŸ› Springer 🌐 English βš– 84 KB