Even Longer Cycles in Essentially 4-Connected Planar Graphs

06/25/2018
by   Igor Fabrici, et al.
0

A planar graph is essentially 4-connected if it is 3-connected and every of its 3-separators is the neighborhood of a single vertex. Jackson and Wormald proved that every essentially 4-connected planar graph G on n vertices contains a cycle of length at least 2n+4/5, and this result has recently been improved multiple times. In this paper, we prove that every essentially 4-connected planar graph G on n vertices contains a cycle of length at least 5/8(n+2). This improves the previously best-known lower bound 3/5(n+2).

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/16/2017

Longer Cycles in Essentially 4-Connected Planar Graphs

A planar 3-connected graph G is called essentially 4-connected if, for e...
02/18/2020

Dynamics of Cycles in Polyhedra I: The Isolation Lemma

A cycle C of a graph G is isolating if every component of G-V(C) is a si...
10/18/2021

Planar Median Graphs and Cubesquare-Graphs

Median graphs are connected graphs in which for all three vertices there...
07/09/2019

A bijection for essentially 3-connected toroidal maps

We present a bijection for toroidal maps that are essentially 3-connecte...
06/16/2020

Confining the Robber on Cographs

In this paper, the notions of trapping and confining the robber on a gra...
01/28/2020

The Complexity of Contracting Planar Tensor Network

Tensor networks have been an important concept and technique in many res...
08/24/2017

The Weisfeiler-Leman Dimension of Planar Graphs is at most 3

We prove that the Weisfeiler-Leman (WL) dimension of the class of all fi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.