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: | Tsikopoulos, Nicholas |
---|---|
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 |
Similar Items
-
Spanning trees, toughness, and eigenvalues of regular graphs
by: Wong, Wiseley
Published: (2013) -
Bipartite Toughness and k-Factors in Bipartite Graphs
by: Guizhen Liu, et al.
Published: (2008-01-01) -
On the pancyclicity of 1-tough graphs
by: Rao Li
Published: (2020-11-01) -
Factorization of graphs /
by: Baker, Ronald Dee
Published: (1975) -
Boundary properties of graphs
by: Korpelainen, Nicholas
Published: (2012)