Open AccessOn long cycles through four prescribed vertices of a polyhedral graph
Author(s) -
Jochen Harant,
Stanislav Jendrol′,
Hans Walther
Publication year - 2008
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1418
Subject(s) - mathematics , combinatorics , graph , wheel graph , graph power , line graph
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length at least 1 36 c + 20 3 through any four vertices of G.
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