On the factor-thickness of regular graphs
For each r-regular graph G, define a binary sequenceθ(G) = (θ 1,θ 2,...,θ r-1) byθ k = 0 if G has ak-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...
Saved in:
Main Authors: | Peng, Yee Hock, Chen, Chuan Chong, Koh, Khee Meng |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer
1989
|
Online Access: | http://psasir.upm.edu.my/id/eprint/38739/1/a77%20-%20on%20the%20factor%20thickness%20of%20regular%20graphs.pdf http://psasir.upm.edu.my/id/eprint/38739/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On graphs without multicliqual edges
by: Lim, Chong Keang, et al.
Published: (1981) -
On Hamilton cycles in regular graphs / Nor Nadia Zainal Abidin
by: Nor Nadia, Zainal Abidin
Published: (2017) -
On minimal regular graphs with given constraintsm / Gan, Che Sheng
by: Gan, Che Sheng
Published: (2002) -
Two families of chromatically unique graphs.
by: Yee, Hock Peng
Published: (1992) -
On the dominating number, independent number and the regularity of the relative co-prime graph of a group
by: Abd. Rhani, N., et al.
Published: (2017)