𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The pagewidth of trivalent planar graphs

✍ Scribed by Elena Stöhr

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
372 KB
Volume
89
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We prove the following result: there exist trivalent n-vertex planar graphs, any 2-page embedding of which has pagewidth Q(n).

📜 SIMILAR VOLUMES

Curvature dimension of trivalent graphs
Curvature dimension of trivalent graphs
✍ Kazushiro Kobayashi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 422 KB

In this paper we show that the curvature dimension, recently defined by Taniyama [5], of connected trivalent graphs in Euclidean space equals two in the case of bridgeless graphs and one for graphs having one or two bridges. We also show that there exists a connected trivalent graph in Euclidean spa

-constructibility of planar graphs
-constructibility of planar graphs
✍ C. M. Mynhardt; I. Broere 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

## Abstract In this paper, the concept of the 𝒢‐constructibility of graphs is introduced and investigated with particular reference to planar graphs. It is conjectured that the planar graphs are minimally __N__‐constructible, where __N__ is a finite set of graphs and an infinite set 𝒢 is obtained s

Choosability of planar graphs
Choosability of planar graphs
✍ Margit Voigt 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 175 KB

A graph G = G(EE) with lists L(v), associated with its vertices v E V, is called L-list colourable if there is a proper vertex colouring of G in which the colour assigned to a vertex v is chosen from L(v). We say G is k-choosable if there is at least one L-list colouring for every possible list assi

A canonical representation of trivalent
A canonical representation of trivalent hamiltonian graphs
✍ Roberto Frucht 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 477 KB 👁 1 views

## Abstract A canonical representation of trivalent hamiltonian graphs in the form of “span lists” had been proposed by J. Lederberg. It is here presented in a modified form due to H. S. M. Coxeter and the author, and therefore called “LCF notation.” This notation has the advantage of being more co