✦ LIBER ✦

On Hamiltonian Graphs with Maximal Index

✍ Scribed by Rowlinson, Peter

Book ID: 122700360
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 576 KB
Volume: 10
Category: Article
ISSN: 0195-6698
DOI: 10.1016/S0195-6698(89)80023-X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On k-path hamiltonian maximal planar gra

On k-path hamiltonian maximal planar graphs

✍ İlker Baybars 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Extremal maximal uniquely hamiltonian gr

Extremal maximal uniquely hamiltonian graphs

✍ 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.

Square Hamiltonian cycles in graphs with

Square Hamiltonian cycles in graphs with maximal 4-cliques

✍ H.A. Kierstead; Juan Quintana 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 615 KB

The square of a graph is obtained by adding additional edges joining all pairs of vertices with distance two in the original graph. P6sa conjectured that if G is a simple graph on n vertices with minimum degree 2n/3, then G contains the square of a hamiltonian cycle. We show that P6sa's conjecture h

Construction of maximally non-Hamiltonia

Construction of maximally non-Hamiltonian graphs

✍ Roldugin, P.V. 📂 Article 📅 2003 🏛 Walter de Gruyter GmbH & Co. KG 🌐 English ⚖ 127 KB

Any Maximal Planar Graph with Only One S

Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian

✍ Chiuyuan Chen 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 67 KB

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.