๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The maximal genus of planar graphs

โœ Scribed by A. D. Glukhov

Book ID
112478461
Publisher
Springer
Year
1982
Tongue
English
Weight
267 KB
Volume
34
Category
Article
ISSN
0041-5995

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Edge-disjoint maximal planar graphs
Edge-disjoint maximal planar graphs
โœ Sharon G. Boswell; Jamie Simpson ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 316 KB

We show that if n >~6m then it is possible to construct m edge-disjoint maximal planar graphs on a set of n vertices, but that it is not possible if n < 6m -1. We also show that given a pair of edge-disjoint maximal planar graphs, and a specified face in one, there exist at least three faces in the

On the connectivity of maximal planar gr
On the connectivity of maximal planar graphs
โœ S. L. Hakimi; E. F. Schmeichel ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 254 KB ๐Ÿ‘ 1 views
Maximal planar graphs of diameter two
Maximal planar graphs of diameter two
โœ Karen Seyffarth ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 1020 KB

A maximal planar graph is a simple planar graph in which every face is a triangle. We show here that such graphs with maximum degree A and diameter two have no more than :A + 1 vertices. We also show that there exist maximal planar graphs with diameter two and exactly LiA + 1 J vertices.