✦ LIBER ✦

On maximal planarization of nonplanar graphs

✍ Scribed by Thulasiraman, K.; Jayakumar, R.; Swamy, M.

Book ID: 114614067
Publisher: IEEE
Year: 1986
Weight: 258 KB
Volume: 33
Category: Article
ISSN: 0098-4094
DOI: 10.1109/tcs.1986.1085997

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Planar Graphs on Nonplanar Surfaces

✍ Bojan Mohar; Neil Robertson 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 738 KB

It is shown that embeddings of planar graphs in arbitrary surfaces other than the 2-sphere have a special structure. It turns out that these embeddings can be described in terms of noncontractible curves in the surface, meeting the graph in at most two points (which may taken to be vertices of the g

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

On k-path hamiltonian maximal planar gra

On k-path hamiltonian maximal planar graphs

✍ İlker Baybars 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 239 KB

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

The maximal genus of planar graphs

✍ A. D. Glukhov 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 267 KB

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.