A slight strengthening of a theorem of Blair and Kunen
β Scribed by Kees Doets
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 357 KB
- Volume
- 97
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider connected, locally connected graphs in which the maximum and minimum degrees differ by a t most one and do not exceed five. It is shown that if C is a nonhamiltonian cycle in such a graph G, then there exists a cycle C' in G such that V(C) C V(C7 and IV(C')l = (V(C)I + 1. ## 1. Introduc
A. Kotzig [5] proved the following theorem (cf. B. Griinbaum [2,3,4]: Every 3-polytope has at least one edge such that the sum of valencies of its end-vertices is ~< 13. In this note we deal with improvements of this statement. Let us review first some of the notations employed: If we are given a p