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
On an interpolation property of outerplanar graphs
β Scribed by Ko-Wei Lih; Chen-Ying Lin; Li-Da Tong
- Book ID
- 108112555
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 121 KB
- Volume
- 154
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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 eve
## Abstract A graph __G__ has property __A(m, n, k)__ if for any sequence of __m__ + __n__ distinct points of __G__, there are at least __k__ other points, each of which is adjacent to the first __m__ points of the sequence but not adjacent to any of the latter __n__ points. the minimum order among