𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymptotic connectivity of hyperbolic planar graphs

✍ Scribed by Patrick Bahls; Michael R. Dipasquale

Book ID
108114262
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
261 KB
Volume
310
Category
Article
ISSN
0012-365X

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
2-Connected Spanning Subgraphs of Planar
2-Connected Spanning Subgraphs of Planar 3-Connected Graphs
✍ D.W. Barnette πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 278 KB

We prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum valence 15 . We give an example of a planar 3 -connected graph with no spanning 2-connected subgraph of maximum valence five. i) 1994 Academic Press, Inc.

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