Please use this identifier to cite or link to this item:
|Title:||On the factor-thickness of regular graphs|
|Citation:||Peng, Y.H., Chen, C.C., Koh, K.M. (1989-12). On the factor-thickness of regular graphs. Graphs and Combinatorics 5 (1) : 173-188. ScholarBank@NUS Repository. https://doi.org/10.1007/BF01788668|
|Abstract:||For each r-regular graph G, define a binary sequence θ(G) = (θ1, θ2,..., θr-1) by θk = 0 if G has a k-factor, and θk = 1 otherwise. A binary sequence ε = (εi|i = 1, 2,..., r - 1) is said to be realizable if there exists an r-regular graph G such that θ(G) = ε. In this paper we characterize all binary sequences which are realizable. © 1989 Springer-Verlag.|
|Source Title:||Graphs and Combinatorics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 21, 2018
checked on May 11, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.