Longest cycles in cyclically 4-edge-connected cubic planar graphs

Publikationstyp
Journal Article
Date Issued
2018
Sprache
English
Author(s)
Lo, On-Hei Solomon  
Schmidt, Jens M.  orcid-logo
TORE-URI
http://hdl.handle.net/11420/7611
Journal
The Australasian journal of combinatorics  
Volume
72
Start Page
155
End Page
162
Citation
Australasian Journal of Combinatorics (2018)
Publisher Link
http://ajc.maths.uq.edu.au/pdf/72/ajc_v72_p155.pdf
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