A strengthening of Kikustapos;s theorem
Author:
- 1 June 1989
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 13 (2) , 257-260
Abstract
We consider connected, locally connected graphs in which the maximum and minimum degrees differ by at 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 Capos; in G such that V(C) ⊆ V(Capos;) and /V(Capos;) = /(C) + 1.Keywords
This publication has 2 references indexed in Scilit:
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonianJournal of Graph Theory, 1979
- GRAPH THEORY1969