Circumference of essentially 4-connected planar triangulations
Combinatorics
2021-01-28 v2
Abstract
A -connected graph is essentially -connected if, for any -cut of , at most one component of contains at least two vertices. We prove that every essentially -connected maximal planar graph on vertices contains a cycle of length at least ; moreover, this bound is sharp.
Cite
@article{arxiv.2101.03802,
title = {Circumference of essentially 4-connected planar triangulations},
author = {Igor Fabrici and Jochen Harant and Samuel Mohr and Jens M. Schmidt},
journal= {arXiv preprint arXiv:2101.03802},
year = {2021}
}