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...
| 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 |