✦ LIBER ✦

A 1-tough nonhamiltonian maximal planar graph

✍ Scribed by Takao Nishizeki

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 93 KB
Volume: 30
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90240-x

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 shortness exponent of 1-tough, ma

On the shortness exponent of 1-tough, maximal planar graphs

✍ Michal Tkáč 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 454 KB

It is shown that the shortness exponent of the class of l-tough, maximal planar graphs is at most log, 5. The non-Hamiltonian, l-tough, maximal planar graph with a minimum number of vertices is presented.

An upper bound on the shortness exponent

An upper bound on the shortness exponent of 1-tough, maximal planar graphs

✍ Michael B. Dillencourt 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 292 KB

graphs is at most log, 6.

All nonhamiltonian tough graphs satisfyi

All nonhamiltonian tough graphs satisfying a 3-degree sum and fan-type conditions

✍ W. Frydrych 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 819 KB

Frydrych, W., All nonhamiltonian tough graphs satisfying a 3-degree sum and Fan-type conditions, Discrete Mathematics 121 (1993) 93-104. It is shown that if G is a l-tough nonhamiltonian graph on even number vertices n>4 such that d(x)+d(y)+d(z)>n for every triple of mutually distinct and nonadjace

On the number of hamiltonian cycles in a

On the number of hamiltonian cycles in a maximal planar graph

✍ S. L. Hakimi; E. F. Schmeichel; C. Thomassen 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 2 views

## Abstract We consider the problem of the minimum number of Hamiltonian cycles that could be present in a Hamiltonian maximal planar graph on __p__ vertices. In particular, we construct a __p__‐vertex maximal planar graph containing exactly four Hamiltonian cycles for every __p__ ≥ 12. We also pro

On the number of cycles of length 4 in a

On the number of cycles of length 4 in a maximal planar graph

✍ Ahmad Fawzi Alameddine 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB 👁 2 views

## Abstract Let __p__ and __C__~4~ (__G__) be the number of vertices and the number of 4‐cycles of a maximal planar graph __G__, respectively. Hakimi and Schmeichel characterized those graphs __G__ for which __C__~4~ (__G__) = 1/2(__p__^2^ + 3__p__ ‐ 22). This characterization is correct if __p__ ≥