𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Light subgraphs of graphs embedded in the plane—A survey

✍ Scribed by Jendrol’, S.; Voss, H.-J.

Book ID
118275283
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
283 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs embedded in the plane with a boun
Graphs embedded in the plane with a bounded number of accumulation points
✍ C. Paul Bonnington; R. Bruce Richter 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract Halin's Theorem characterizes those infinite connected graphs that have an embedding in the plane with no accumulation points, by exhibiting the list of excluded subgraphs. We generalize this by obtaining a similar characterization of which infinite connected graphs have an embedding in

The number of edges in a subgraph of a H
The number of edges in a subgraph of a Hamming graph
✍ R. Squier; B. Torrence; A. Vogt 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 363 KB

G be a subgraph of the Cartesian product Hamming graph (Kp)r with n vertices. Then the number of edges of G is at most (1/2)(p -1) log, n, with equality holding if and only G is isomorphic to (Kp)s for some s 5 r.