Premium
Cycles through vertices of large maximum degree
Author(s) -
Jackson Bill
Publication year - 1995
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.3190190204
Subject(s) - combinatorics , mathematics , degree (music) , graph , wheel graph , discrete mathematics , graph power , physics , line graph , acoustics
Let G be a 2‐connected graph on n vertices with maximum degree k where n ≤ 3 k ‐ 2. We show that there is a cycle in G that contains all vertices of degree k. © 1995 John Wiley & Sons, Inc.
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