✦ LIBER ✦

Toughness and nonhamiltonicity of polyhedral graphs

✍ Scribed by Jochen Harant

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 373 KB
Volume: 113
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90519-y

No coin nor oath required. For personal study only.

✦ Synopsis

By a theorem of W.T. Tutte the toughness t(G) of a nonhamiltonian polyhedral graph G is less than or equal to $. Nonhamiltonian regular polyhedral graphs G with t(G) = ; are constructed; moreover, it is shown that the shortness exponent of the considered classes of polyhedral graphs is less than 1.

📜 SIMILAR VOLUMES

Toughness, hamiltonicity and split graph

Toughness, hamiltonicity and split graphs

✍ Dieter Kratsch; Jenő Lehel; Haiko Müller 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 728 KB

Toughness and Triangle-Free Graphs

✍ D. Bauer; J. Vandenheuvel; E. Schmeichel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 520 KB

Toughness and spectrum of a graph

✍ A.E. Brouwer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Even polyhedral decompositions of cubic

Even polyhedral decompositions of cubic graphs

✍ M. Preissmann 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 136 KB

An even polyhedral decomposition of a finite cubic grap;'i G is defined a-, a sel of elem,:nlar~ cycles of even length ir~ G with the property that each edge of G lies in exactly two of them. l~" G has chromatic index three, then G has an e~en !polyhedral decomposition. We ~d~ow ~hat. contrary to a

Toughness and matching extension in grap

Toughness and matching extension in graphs

✍ M.D. Plummer 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 588 KB

Toughness of graphs and the existence of

Toughness of graphs and the existence of factors

✍ P. Katerinis 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 643 KB

## Theorem 2. Let G be a 2-tough graph. Then for any function f : V(G)+ { 1, 2) such that C xsvCcj f (x) in euen, G has an f-factor. Before stating the second main theorem of this paper it is necessary to make the following definition. Let G be a graph and let g and f be two integer-valued functi