𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The reconstruction of maximal planar graphs. I. Recognition

✍ Scribed by S Fiorini; J Lauri

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
363 KB
Volume
30
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

Maximal chromatic polynomials of connect
Maximal chromatic polynomials of connected planar graphs
✍ Ioan Tomescu πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 429 KB πŸ‘ 1 views

## Abstract In this paper we obtain chromatic polynomials of connected 3‐ and 4‐chromatic planar graphs that are maximal for positive integer‐valued arguments. We also characterize the class of connected 3‐chromatic graphs having the maximum number of __p__‐colorings for __p__ β‰₯ 3, thus extending a

Edge-reconstruction of 4-connected plana
Edge-reconstruction of 4-connected planar graphs
✍ S. Fiorini; J. Lauri πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 482 KB πŸ‘ 2 views

## Abstract The object of this paper is to show that 4‐connected planar graphs are uniquely determined from their collection of edge‐deleted subgraphs.