Toughness and factors in graphs
The author proved independently, every 2-tough graph is hamiltonian (3), that if G is a K-tough graph with n vertices and if kn is even then G has a k-factor (4) is best possible by showing that for every positive integer k and for every positive $ varepsilon$ there is a (k-$ varepsilon$)-tough grap...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
McGill University
1987
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=59616 |