𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Diameter bounds for planar graphs

✍ Scribed by Radoslav Fulek; Filip Morić; David Pritchard

Book ID
108114284
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
313 KB
Volume
311
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Diameter bounds for altered graphs
Diameter bounds for altered graphs
✍ F. R. K. Chung; M. R. Garey 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 928 KB

The main question addressed in this article is the following: If t edges are removed from a ( t + 1) edge-connected graph G having diameter D, how large can the diameter of the resulting graph be? (The diameter of a graph is the maximum, over all pairs of vertices, of the length of the shortest path

Homomorphism bounds for oriented planar
Homomorphism bounds for oriented planar graphs
✍ T. H. Marshall 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

## Abstract If ${\cal C}$ is a class of oriented graphs (directed graphs without opposite arcs), then an oriented graph is a __homomorphism bound__ for ${\cal C}$ if there is a homomorphism from each graph in ${\cal C}$ to __H__. We find some necessary conditions for a graph to be a homomorphism bo

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.