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
β¦ LIBER β¦
Two conjectures concerning nonlinear circuit problems
β Scribed by Makoto Itoh; Ryuichi Tomiyasu
- Book ID
- 112079156
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 596 KB
- Volume
- 72
- Category
- Article
- ISSN
- 1042-0967
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
Two conjectures of Demetrovics, FΓΌredi,
β
Bernhard Ganter; Hans-Dietrich O.F. Gronau
π
Article
π
1991
π
Elsevier Science
π
English
β 414 KB
It is possible to find II partitions of an n-element set whose pairwise intersections are just all atoms of the partition lattice? Demetrovics, Ftiredi and Katona verified this for all n -1 or 4 (mod 12) by constructing a series of special Mendelsohn Triple Systems. They conjectured that such tripl
A result concerning two conjectures of B
β
M. Gionfriddo; S. Milici
π
Article
π
1996
π
Elsevier Science
π
English
β 142 KB
A remark on two conjectures of Hasson co
β
S. P. Zhou
π
Article
π
1993
π
Springer
π
English
β 230 KB
Concerning the theory of nonlinear minim
β
V. N. Malozemov
π
Article
π
1973
π
Springer US
π
English
β 294 KB
Problems and conjectures concerning conn
β
JΓΈrgen Bang-Jensen
π
Article
π
2009
π
Elsevier Science
π
English
β 811 KB