𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A planarity criterion for cubic bipartite graphs

✍ Scribed by T. Böhme; J. Harant; A. Pruchnewski; I. Schiermeyer

Book ID
108316260
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
719 KB
Volume
191
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 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.

The smallest 2-connected cubic bipartite
The smallest 2-connected cubic bipartite planar nonhamiltonian graph
✍ Takao Asano; Nobuji Saito; Geoffrey Exoo; Frank Harary 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 519 KB

## Butte producxd ihe first example of a 3-connected cubic planar nonhamihonian gJaph. On adding the cxmcition that the graph must he bipartite and admitting 2-connected graphs. We prove that the smallest possible such graph has 26 points and is unique.

Bipartite cubic graphs and a shortness e
Bipartite cubic graphs and a shortness exponent
✍ P.J. Owens 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 148 KB

The class of 3-connected bipartite cubic graphs is shown to contain a oon-Hamiltonian graph with only 78 vertices and to have a shortness exponent less than one. In this paper, a graph is a simple undirected gaph and a subgraph is an induced subgraph. For a~ay graph G, v(G) denotes the number of ve

A criterion for the planarity of a graph
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