𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7

✍ Scribed by Edita Máčajová; Martin Škoviera

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
292 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the girth of infinite graphs
On the girth of infinite graphs
✍ Norbert Seifter 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 599 KB

Let X be an infinite k-valent graph with polynomial growth of degree d, i.e. there is an integer d and a constant c such that fx(n) 3, d> 1, 123, there exist k-valent connected graphs with polynomial growth of degree d and girth greater than 1. This means that in general the girth of graphs with pol

Domination number of cubic graphs with l
Domination number of cubic graphs with large girth
✍ Daniel Král'; Petr Škoda; Jan Volec 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n+O(n / g) < 3n / 10+O(n / g) This research was done when the Petr Škoda was a student of

The smallest graph of girth 6 and valenc
The smallest graph of girth 6 and valency 7
✍ M. O'Keefe; P. K. Wong 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB

## Abstract With the aid of a computer. we give a regular graph of girth 6 and valency 7, which has 90 vertices and show that this is the unique smallest graph with these properties.