Premium
Cycles in a graph whose lengths differ by one or two
Author(s) -
Bondy J. A.,
Vince A.
Publication year - 1998
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/(sici)1097-0118(199801)27:1<11::aid-jgt3>3.0.co;2-j
Subject(s) - combinatorics , mathematics , graph , vertex (graph theory) , discrete mathematics
Several problems concerning the distribution of cycle lengths in a graph have been proposed by P. Erdös and colleagues. In this note two variations of the following such question are answered. In a simple graph where every vertex has degree at least three, must there exist two cycles whose lengths differ by one or two? © 1998 John Wiley & Sons, Inc. J Graph Theory 27: 11–15, 1998
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