Premium
A strengthening of Kikustapos;s theorem
Author(s) -
Hendry George R. T.
Publication year - 1989
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190130212
Subject(s) - mathematics , combinatorics , graph , discrete mathematics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom