𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximally non-hamiltonian graphs of girth 7

✍ Scribed by Ladislav Stacho

Publisher
Springer Japan
Year
1996
Tongue
English
Weight
689 KB
Volume
12
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Non-hamiltonian 54-tough maximal planar
Non-hamiltonian 54-tough maximal planar graphs
✍ Jochen Harant; Peter J. Owens πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 194 KB

By a theorem of the toughness t(G) of a non-hamiitonian maximal planar graph G is less than or equal to 2. Improving a result of , it is shown that the shortness exponent of the class of maximal planar graphs with toughness greater than or equal to ~ is less than 1.

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

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

Maximizing the spectral radius of bicycl
Maximizing the spectral radius of bicyclic graphs with fixed girth
✍ Mingqing Zhai; Yarong Wu; Jinlong Shu πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 248 KB

Let B(n, g) be the set of bicyclic graphs on n vertices with girth g. In this paper, we determine the unique graph with the maximal spectral radius among all graphs in B(n, g). Moreover, the maximal spectral radius is a decreasing function on g.