On the factor-thickness of regular graphs |
| |
| Authors: | Y H Peng C C Chen K M Koh |
| |
| Institution: | (1) Department of Mathematics, National University of Singapore, 0511 Kent Ridge, Singapore |
| |
| Abstract: | For eachr-regular graphG, define a binary sequence (G) = (
1,
2,...,
r-1) by
k
= 0 ifG has ak-factor, and
k
= 1 otherwise. A binary sequence = (
i
|i = 1, 2,...,r – 1) is said to be realizable if there exists anr-regular graphG such that(G) = . In this paper we characterize all binary sequences which are realizable. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
