✦ LIBER ✦

A strengthening of the Kuratowski planarity criterion for 3-connected graphs

✍ Scribed by A.K. Kelmans

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 617 KB
Volume: 51
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90001-3

No coin nor oath required. For personal study only.

✦ Synopsis

Re&ved 4 Fkbruary

📜 SIMILAR VOLUMES

A new planarity criterion for 3-connecte

A new planarity criterion for 3-connected graphs

✍ Alexander K. Kelmans 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 474 KB 👁 1 views

## Abstract Direct proofs of some planarity criteria are presented.

A short proof of Kuratowski's graph plan

A short proof of Kuratowski's graph planarity criterion

✍ Makarychev, Yury 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 2 views

We present a new short combinatorial proof of the sufficiency part of the well-known Kuratowski's graph planarity criterion. The main steps are to prove that for a minor minimal non-planar graph G and any edge xy: (1) G-x-y does not contain θ-subgraph; (2) G-x-y is homeomorphic to the circle; (3)

A criterion for the planarity of a graph

✍ Jerome R. Breitenbach 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB 👁 1 views

In a recent paper, Carsten Thomassen [Carsten Thomassen, Planarity and duality of finite and infinite graphs. J. Combinatorial Theory Ser. B 29 (1980) 244-2711 has shown that a number of criteria for the planarity of a graph can be reduced to that of Kuratowski. Here we present another criterion whi

The Isomorphism Problem for Planar 3-Con

The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace

✍ Thomas Thierauf; Fabian Wagner 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 567 KB

Minor and minimum cycle bases of a 3-con

Minor and minimum cycle bases of a 3-connected planar graph

✍ Deng Ju Ma; Han Ren 📂 Article 📅 2009 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 223 KB

Degree bounds for the circumference of 3

Degree bounds for the circumference of 3-connected graphs

✍ Heinz A. Jung; Elkin Vumar 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB 👁 1 views

## Abstract Let __C__ be a longest cycle in the 3‐connected graph __G__ and let __H__ be a component of __G__ − __V__(__C__) such that |__V__(__H__)| ≥ 3. We supply estimates of the form |__C__| ≥ 2__d__(__u__) + 2__d__(__v__) − α(4 ≤ α ≤ 8), where __u__,__v__ are suitably chosen non‐adjacent verti