𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Construction of maximally non-Hamiltonian graphs

✍ Scribed by Roldugin, P.V.


Book ID
120137480
Publisher
Walter de Gruyter GmbH & Co. KG
Year
2003
Tongue
English
Weight
127 KB
Volume
13
Category
Article
ISSN
0924-9265

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Non-hamiltonian 54-tough maximal planar
✍ 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.

Extremal maximal uniquely hamiltonian gr
✍ Curtiss A. Barefoot; R. C. Entringer πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 352 KB

## Abstract Let __G__ be a graph of order __n__ with exactly one Hamiltonian cycle and suppose that __G__ is maximal with respect to this property. We determine the minimum number of edges __G__ can have.

Non-hamiltonian bicubic graphs
✍ John P Georges πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 192 KB