• Corpus ID: 211146507

Dynamics of Cycles in Polyhedra I: The Isolation Lemma

  title={Dynamics of Cycles in Polyhedra I: The Isolation Lemma},
  author={Jan Kessler and Jens M. Schmidt},
A cycle $C$ of a graph $G$ is \emph{isolating} if every component of $G-V(C)$ is a single vertex. We show that isolating cycles in polyhedral graphs can be extended to larger ones: every isolating cycle $C$ of length $6 \leq |E(C)| < \left \lfloor \frac{2}{3}(|V(G)|+4) \right \rfloor$ implies an isolating cycle $C'$ of larger length that contains $V(C)$. By "hopping" iteratively to such larger cycles, we obtain a powerful and very general inductive motor for proving long cycles and computing… 

Figures from this paper

On Tutte cycles containing three prescribed edges
A cycle C in a graph G is called a Tutte cycle if, after deleting C from G, each component has at most three neighbors on C. Tutte cycles play an important role in the study of Hamiltonicity of


Longer Cycles in Essentially 4-Connected Planar Graphs
It is proved that an essentially 4-connected planar graph on n vertices contains a cycle of length at least 35(n+2) {3 \over 5} ( {n + 2} ) and that such a cycle can be found in time O(n2).
Computing 2-Walks in Polynomial Time
Gao, Richter and Yu proved that every 3-connected planar graph contains a closed 2-walk such that all vertices visited twice are contained in 3-separators.
The binding number of a graph and its Anderson number
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.
Finding Tutte paths in linear time
A new proof is given that 2-connected planar graphs have Tutte paths which leads easily to a linear-time algorithm to find Tuttepaths, a strengthening that allows applications (such as finding 2-walks) to be done in linear time.
Polyhedra of Small Order and Their Hamiltonian Properties
The smallest non-Hamiltonian planar graphs satisfying certain toughness-like properties are presented here, as are the smallest non -Hamiltonian, 3-connected, Delaunay tessellations and triangulations.
Circumference of essentially 4-connected planar triangulations
It is proved 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.
Congruent Graphs and the Connectivity of Graphs
We give here conditions that two graphs be congruent and some theorems on the connectivity of graphs, and we conclude with some applications to dual graphs. These last theorems might also be proved
Longest cycles in 3-connected planar graphs
Longest cycles and their chords
On etablit la conjecture de Thomassen concernant l'existence d'une corde pour tous les plus longs cycles d'un graphe 3-connexe dans le cas d'un graphe planaire s'il est cubique ou si δ≥4