• Corpus ID: 235458604

On Tutte cycles containing three prescribed edges

  title={On Tutte cycles containing three prescribed edges},
  author={Michael C. Wigal and Xingxing Yu},
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 planar graphs. Thomas and Yu and independently Sanders proved the existence of Tutte cycles containining three specified edges of a facial cycle in a 2-connected plane graph. We prove a quantitative version of this result, bounding the number of components of the graph obtained by deleting a Tutte cycle… 

Figures from this paper

On Hamilton cycles in certain planar graphs

Let G be a 2-connected plane graph with outer cycle XG such that for every minimal vertex cut S of G with |S| ≤ 3, every component of G\S contains a vertex of XG. A sufficient condition for G to be

Large cycles in essentially 4-connected graphs.

Tutte proved that every 4-connected planar graph contains a Hamilton cycle, but there are 3-connected $n$-vertex planar graphs whose longest cycles have length $\Theta(n^{\log_32})$. On the other

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.

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.

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices

A theorem on paths in planar graphs

We prove a theorem on paths with prescribed ends in a planar graph which extends Tutte's theorem on cycles in planar graphs [9] and implies the conjecture of Plummer [5] asserting that every

4-Connected Projective-Planar Graphs Are Hamiltonian

The result stated in the title and a conjecture of Plummer that every graph which can be obtained from a 4-connected planar graph by deleting two vertices is Hamiltonian are proved.

A theorem on paths in planar graphs

C. Thomassen extended Tutte's theorem on cycles in planar graphs in the paper “A Theorem on Paths in Planar Graphs”. This note corrects a flaw in his proof.

On Hamiltonian Circuits