✦ LIBER ✦

Bijective proofs of two broken circuit theorems

✍ Scribed by Andreas Blass; Bruce Eli Sagan

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 362 KB
Volume: 10
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190100104

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

Short proofs for two theorems of Chien,

Short proofs for two theorems of Chien, Hell and Zhu

✍ Tracy Holt; Yared Nigussie 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

In (J Graph Theory 33 (2000) , 14-24), Hell and Zhu proved that if a series-parallel graph G has girth at least 2 (3k -1) / 2 , then c (G) ≤ 4k / (2k -1). In (J Graph Theory 33 (2000), [185][186][187][188][189][190][191][192][193][194][195][196][197][198], Chien and Zhu proved that the girth condit