Longer Cycles in Essentially 4-Connected Planar Graphs

10/16/2017
by   Igor Fabrici, et al.
0

A planar 3-connected graph G is called essentially 4-connected if, for every 3-separator S, at least one of the two components of G-S is an isolated vertex. Jackson and Wormald proved that the length circ(G) of a longest cycle of any essentially 4-connected planar graph G on n vertices is at least 2n+4/5 and Fabrici, Harant and Jendrol' improved this result to circ(G)≥1/2(n+4). In the present paper, we prove that an essentially 4-connected planar graph on n vertices contains a cycle of length at least 3/5(n+2) and that such a cycle can be found in time O(n^2).

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/25/2018

Even Longer Cycles in Essentially 4-Connected Planar Graphs

A planar graph is essentially 4-connected if it is 3-connected and every...
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...
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...
02/04/2021

All Subgraphs of a Wheel are 5-Coupled-Choosable

A wheel graph consists of a cycle along with a center vertex connected t...
04/26/2019

Retracting Graphs to Cycles

We initiate the algorithmic study of retracting a graph into a cycle in ...
11/06/2020

Algorithmic Extensions of Dirac's Theorem

In 1952, Dirac proved the following theorem about long cycles in graphs ...
This week in AI

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

References

  • [1] M. B. Dillencourt, Polyhedra of Small Order and Their Hamiltonian Properties, J. Combin. Theory, Ser. B 66 (1996), 87–122.
  • [2] I. Fabrici, J. Harant, S. Jendroľ, On longest cycles in essentially -connected planar graphs, Discuss. Math. Graph Theory 36 (2016), 565–575.
  • [3] B. Grünbaum, J. Malkevitch, Pairs of edge-disjoint Hamilton circuits, Aequationes Math. 14 (1976), 191–196.
  • [4] B. Jackson, N. C. Wormald, Longest cycles in -connected planar graphs, J. Combin. Theory, Ser. B 54 (1992), 291–321.
  • [5] D. P. Sanders, On paths in planar graphs, J. Graph Theory 24:4 (1997), 341–345.
  • [6] A. Schmid, J. M. Schmidt, Computing Tutte Paths, arXiv-preprint (https://arxiv.org/abs/1707.05994), July 2017.
  • [7] C.-Q. Zhang, Longest cycles and their chords, J. Graph Theory 11 (1987), 521–529.