Options
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Publikationstyp
Journal Article
Date Issued
2018
Sprache
English
Author(s)
TORE-URI
Volume
72
Start Page
155
End Page
162
Citation
Australasian Journal of Combinatorics (2018)
Publisher Link
Publisher
Centre for Discrete Mathematics and Computing, Univ. of Queensland
Grünbaum and Malkevitch proved in 1976 that the shortness coefficient of cyclically 4-edge-connected cubic planar graphs is at most 76/77. We prove that it is at most 359/366 (< 52/53).
DDC Class
510: Mathematik