Please use this identifier to cite or link to this item:
|Title:||Disjoint Cycles with Chords in Graphs|
|Publisher:||JOHN WILEY & SONS INC|
|Citation:||JOURNAL OF GRAPH THEORY, 60(2), 87-98|
|Abstract:||Let n(1), n(2),..., n(k) be integers, n = Sigma n(i), n(i) >= 3, and let for each 1 <= i <= k, H(i) be a cycle or a tree on n(i) vertices. We prove that every graph G of order at least n with sigma(2)(G) >= 2(n - k) - 1 contains k vertex disjoint subgraphs H(1)('), H(2)('),..., H(k)('), where H(i)(') = H(i), if H(i) is a tree, and H(i)(') is a cycle with n(i) - 3 chords incident with a common vertex, if H(i), is a cycle. (C) 2008 Wiley Periodicals Inc. J Graph Theory 60: 87-98, 2009|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.