The toughness of split graphs
โ Scribed by Gerhard J. Woeginger
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 117 KB
- Volume
- 190
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
In this short note we argue that the toughness of split graphs can be computed in polynomial time.
๐ SIMILAR VOLUMES
## Chernyak, A.A. and Z.A. Chernyak, Split dimension of graphs, Discrete Mathematics 89 (1991) l-6.
Let G be a graph and let t ี 0 be a real number. Then, We discuss how the toughness of (spanning) subgraphs of G and related graphs depends on (G), we give some sufficient degree conditions implying that (G) ี t, and we study which subdivisions of 2-connected graphs have minimally 2-tough squares.
In this paper, split graphs with a regular endomorphism monoid are characterized explicitly.
It is proved that a split graph is an absolute retract of split graphs if and only if a partition of its vertex set into a stable set and a complete set is unique or it is a complete split graph. Three equivalent conditions for a split graph to be an absolute retract of the class of all graphs are g