𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructions of hamiltonian graphs with bounded degree and diameter

✍ Scribed by Aleksandar Ilić; Dragan Stevanović

Book ID
108052485
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
437 KB
Volume
22
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Circumference of Graphs with Bounded Deg
Circumference of Graphs with Bounded Degree
✍ Chen, Guantao; Xu, Jun; Yu, Xingxing 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 414 KB
Constructions of large planar networks w
Constructions of large planar networks with given degree and diameter
✍ Fellows, M.; Hell, P.; Seyffarth, K. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 3 views

There is considerable interest in constructing large networks with given diameter and maximum degree. In certain applications, there is a natural restriction for the networks to be planar. Thus, consider the problem of determining the maximum number of nodes in a planar network with maximum degree D

Large P4-free graphs with bounded degree
Large P4-free graphs with bounded degree
✍ Myung S. Chung; Douglas B. West 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 424 KB

## Abstract Let __ex__ \* (__D__; __H__) denote the maximum number of edges in a connected graph with maximum degree __D__ and no induced subgraph isomorphic to __H.__ We prove that this is finite only when __H__ is a disjoint union of paths,m in which case we provide crude upper and lower bounds.