K6-Minors in Triangulations on the Klein Bottle

نویسندگان

  • Ken-ichi Kawarabayashi
  • Raiji Mukae
  • Atsuhiro Nakamoto
چکیده

In this paper, we shall characterize triangulations on the Klein bottle without K6-minors. Our characterization implies that every 5-connected triangulation on the Klein bottle has a K6-minor. The connectivity “5” is best possible in a sense that there is a 4-connected triangulation on the Klein bottle without K6-minors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

K6-Minors in triangulations on surfaces

We say that a graph H is a minor of a graph G if H can be obtained from G by a sequence of contractions and deletions of edges. An H-minor is a minor of H. Let Kn denote a complete graph with n vertices. A triangulation of a surface is a fixed embedding of a simple graph on the surface such that each face is bounded by a cycle of length exactly three. It is easy to see that every triangulation ...

متن کامل

Note on the irreducible triangulations of the Klein bottle

We give the complete list of the 29 irreducible triangulations of the Klein bottle. We show how the construction of Lawrencenko and Negami, which listed only 25 such irreducible triangulations, can be modified at two points to produce the 4 additional irreducible triangulations of the Klein bottle.

متن کامل

K6-minors in triangulations and complete quadrangulations

In this paper, we shall prove that a projective-planar (resp., toroidal) triangulation G has K6 as a minor if and only if G has no quadrangulation isomorphic to K4 (resp., K5) as a subgraph. As a application of the theorems, we can prove that Hadwiger’s conjecture is true for projective-planar and toroidal triangulations.

متن کامل

K6-Minors in Triangulations on the Nonorientable Surface of Genus 3

It is easy to characterize graphs with no Kk-minors for any integer k ≤ 4, as follows. For k = 1, 2, the problem must be trivial, and for k = 3, 4, those graphs are forests and series-parallel graphs (i.e., graphs obtained from K3 by a sequence of replacing a vertex of degree 2 with a pair of parallel edges, or its inverse operation.) Moreover, Wagner formulated a fundamental characterization o...

متن کامل

Small snarks and 6-chromatic triangulations on the Klein bottle

It is known that for every nonorientable surface there are infinitely many (large) snarks that can be polyhedrally embedded on that surface. We take a dual approach to the embedding of snarks on the Klein bottle, and investigate edge-colorings of 6-chromatic triangulations of the Klein bottle. In the process, we discover the smallest snarks that can be polyhedrally embedded on the Klein bottle....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2008