Circumference of essentially 4-connected planar triangulations

  title={Circumference of essentially 4-connected planar triangulations},
  author={Igor Fabrici and Jochen Harant and Samuel Mohr and Jens M. Schmidt},
  journal={J. Graph Algorithms Appl.},
A 3-connected graph G is essentially 4-connected if, for any 3-cut S ⊆ V (G) of G, at most one component of G− S contains at least two vertices. We prove that every essentially 4-connected maximal planar graph G on n vertices contains a cycle of length at least 2 3 (n+ 4); moreover, this bound is sharp. 
1 Citations

Figures from this paper

Dynamics of Cycles in Polyhedra I: The Isolation Lemma
The first step towards the so far elusive quest of finding a universal induction that captures longest cycles of polyhedral graph classes is taken, with a powerful and very general inductive motor for proving long cycles and computing them and improves the lower bound to match the upper.


On Longest Cycles in Essentially 4-Connected Planar Graphs
The result of Jackson and Wormald is improved and new lower bounds on the length of a longest cycle of G are presented if G is an essentially 4-connected planar graph of maximum degree 4 orG is an Essentially 4- connected maximal planargraph.
On the Circumference of Essentially 4-connected Planar Graphs
It is proved that every essentially 4-connected planar graph G on n vertices contains a cycle of length at least $\frac{5}{8}(n+2)$.
Longest cycles in 3-connected planar graphs
Nonhamiltonian 3-Connected Cubic Planar Graphs
It is established that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian and this bound is determined to be sharp, and all nonhamiltonian examples of order 42 are presented.
Longest cycles in 3-connected cubic graphs
Hamiltonian circuits on 3-polytopes
On a Closure Concept in Claw-Free Graphs
A suucient condition for hamiltonicity in claw-free graphs, the equivalence of some conjectures on ham Miltonicity in 2-tough graphs and the Hamiltonicity of 7-connected claw- free graphs are obtained as corollaries.
Longest paths and cycles in K1, 3-free graphs
It is shown that the standard results concerning longest paths and cycles in graphs can be improved for K1,3-free graphs and conditions for the existence of a hamiltonian path and cycle are obtained.
Longest cycles in cyclically 4-edge-connected cubic planar graphs
The depositing of published papers in other repositories for non-commercial use is allowed, although the format used to be identical to that as published by us, with the authors' pagination and layout.