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: | , , |
|---|---|
| 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!
|
| id |
my.upm.eprints.38739 |
|---|---|
| record_format |
eprints |
| spelling |
my.upm.eprints.387392015-06-09T06:23:27Z http://psasir.upm.edu.my/id/eprint/38739/ On the factor-thickness of regular graphs Peng, Yee Hock Chen, Chuan Chong Koh, Khee Meng 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 sequences which are realizable. Springer 1989 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/38739/1/a77%20-%20on%20the%20factor%20thickness%20of%20regular%20graphs.pdf Peng, Yee Hock and Chen, Chuan Chong and Koh, Khee Meng (1989) On the factor-thickness of regular graphs. Graphs and Combinatorics, 5 (1). pp. 173-188. ISSN 0911-0119; ESSN: 1435-5914 |
| institution |
Universiti Putra Malaysia |
| building |
UPM Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Putra Malaysia |
| content_source |
UPM Institutional Repository |
| url_provider |
http://psasir.upm.edu.my/ |
| language |
English |
| description |
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 sequences which are realizable. |
| format |
Article |
| author |
Peng, Yee Hock Chen, Chuan Chong Koh, Khee Meng |
| spellingShingle |
Peng, Yee Hock Chen, Chuan Chong Koh, Khee Meng On the factor-thickness of regular graphs |
| author_facet |
Peng, Yee Hock Chen, Chuan Chong Koh, Khee Meng |
| author_sort |
Peng, Yee Hock |
| title |
On the factor-thickness of regular graphs |
| title_short |
On the factor-thickness of regular graphs |
| title_full |
On the factor-thickness of regular graphs |
| title_fullStr |
On the factor-thickness of regular graphs |
| title_full_unstemmed |
On the factor-thickness of regular graphs |
| title_sort |
on the factor-thickness of regular graphs |
| publisher |
Springer |
| publishDate |
1989 |
| url |
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/ |
| _version_ |
1643832223381585920 |
| score |
13.154949 |