𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cycle interpolation properties of graphs

✍ Scribed by Wl̵lodzimierz Ulatowski

Book ID
103059791
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
456 KB
Volume
143
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

The length of a set of cycles of a graph G is the sum of the lengths of its cycles. Consider a family A, of n-element sets of cycles of G. Let c-(A,) and c+(A,) be the minimum and maximum lengths among all sets of A,, respectively. We say that A, has the cycle interpolation property (tip) if for every integer c between c-(A,) and c+ (A,), there exists in A, a set of length c. A graph G has the cycle basis interpolation property (chip) if the family of all cycle bases of G satisfies the tip. The main result of this paper shows that every maximal outerplanar graph has the chip.

📜 SIMILAR VOLUMES

Two families of graphs satisfying the cy
Two families of graphs satisfying the cycle basis interpolation property
✍ Elzbieta B. Jarrett 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 353 KB

The length of a cycle basis of a graph G is the sum of the lengths of its cycles. Let C, c+ be the lengths of the minimal and maximal cycle basis, respectively. Then G has the cycle basis interpolation property (chip) if for all integers c, c-CC CC+, there exists a cycle basis of length c. We const

A Family of special outerplanar graphs w
A Family of special outerplanar graphs with only one triangle satisfying the cycle basis interpolation property
✍ Liu Yan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 268 KB

The length of a cycle basis of a graph G is the sum of the lengths of its cycles. Let c-, c+ be the lengths of the minima1 and maxima1 cycle basis, respectively. Then G has the cycle basis interpolation property (chip) if for all integers c, c-< c < c+, there exists a cycle basis of length c. In thi

Factors in graphs with odd-cycle propert
Factors in graphs with odd-cycle property
✍ Ciping Chen; Jianfang Wang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 634 KB

Chen, C. and J. Wang, Factors in graphs with odd-cycle property, Discrete Mathematics 112 (1993) 29-40. We present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a graph G with the odd-cycle property that any two odd cycles of G either have a vertex in common or are