Please use this identifier to cite or link to this item: https://doi.org/10.1007/BF01788668
Title: On the factor-thickness of regular graphs
Authors: Peng, Y.H.
Chen, C.C. 
Koh, K.M. 
Issue Date: Dec-1989
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
URI: http://scholarbank.nus.edu.sg/handle/10635/103799
ISSN: 09110119
DOI: 10.1007/BF01788668
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

1
checked on Dec 6, 2018

Page view(s)

26
checked on Nov 23, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.