𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Hamiltonian Regular Graphs of Girth Six

✍ Scribed by Brown, W. G.

Book ID
120098730
Publisher
Oxford University Press
Year
1967
Tongue
English
Weight
183 KB
Volume
s1-42
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the girth of hamiltonian weakly pancy
On the girth of hamiltonian weakly pancyclic graphs
✍ BollobοΏ½s, BοΏ½la; Thomason, Andrew πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 130 KB πŸ‘ 2 views

A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circumference. In answer to a question of ErdΕ‘s, we show that a Hamiltonian weakly-pancyclic graph of order n can have girth as large as about 2 n/ log n. In contrast to this, we show that the existence of

On Hamiltonian-connected regular graphs
On Hamiltonian-connected regular graphs
✍ Ioan Tomescu πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 360 KB πŸ‘ 1 views

In this paper it is shown that any rn-regular graph of order 2rn (rn 3 3), not isomorphic to K, , , , or of order 2rn + 1 (rn even, rn 3 4), is Hamiltonian connected, which extends a previous result of Nash-Williams. As a corollary, it is derived that any such graph contains at least rn Hamiltonian

A non-covering graph of girth six
A non-covering graph of girth six
✍ Oliver Pretzel πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 228 KB

We construct a graph of girth 6 that cannot be oriented as the diagram of an ordered set and discuss the reasons why this particular construction cannot be extended to produce examples of larger girth. The problem of characterizing graphs that can be oriented as diagrams of ordered sets (or coverin

Families of small regular graphs of girt
Families of small regular graphs of girth 5
✍ M. Abreu; G. Araujo-Pardo; C. Balbuena; D. Labbate πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 328 KB