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.
10.7151/dmgt.1418 Zitier-Link kopieren
DOI (10.7151/dmgt.1418)
https://doi.org/10.7151/dmgt.1418
URN (urn:nbn:de:gbv:ilm1-2020200167)
https://nbn-resolving.org/urn:nbn:de:gbv:ilm1-2020200167
Nutzung und Vervielfältigung: