𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Closure for the property of having a hamiltonian prism

✍ Scribed by Daniel Král; Ladislav Stacho

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
252 KB
Volume
54
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We prove that a graph G of order n has a hamiltonian prism if and only if the graph Cl~4__n__/3–4/3~(G) has a hamiltonian prism where Cl~4__n__/3–4/3~(G) is the graph obtained from G by sequential adding edges between non‐adjacent vertices whose degree sum is at least 4__n__/3–4/3. We show that this cannot be improved to less than 4__n__/3–5. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 209–220, 2007

📜 SIMILAR VOLUMES

Computation of the 0-dual closure for ha
Computation of the 0-dual closure for hamiltonian graphs
✍ Ingo Schiermeyer 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 601 KB

Schiermeyer, I., Computation of the O-dual closure for hamiltonian graphs, Discrete Mathematics 111 (1993) 455-464. The well-known closure concept of Bondy and Chvbtal (1976) is based on degree sums of pairs of nonadjacent vertices. It generalizes six earlier sufficient degree conditions for hamilto

A construction for large families of k-e
A construction for large families of k-element sets having the Erdös intersection property
✍ Richard Dean 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 77 KB

## Dedicated to E. Corominas Kleitman, Shearer et Sturtevant ont 6tudi6 le probl~me de trouver l'entier maximum m pour lequel il existe une famille de m ensembles A1,..., Am, tous ~ k 616ments, satisfaisant la propri6t6 d'intersection d'Erd6s: A v f3 Aq ¢ AT d~s que p, q, r sont distincts. Nous do

Hamiltonian properties of the cube of a
Hamiltonian properties of the cube of a 2-edge connected graph
✍ M. Paoli 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 514 KB

Let G be a 2-edge connected graph with a t least 5 vertices. For any given vertices a, b, c, and din G with a # b, there exists in G3 a hamiltonian path with endpoints a and b avoiding the edge cd, and there exists in G3 U {cd} a hamiltonian path with endpoints a and b and containing the edge cd. Al

For Groups the Property of Having Finite
For Groups the Property of Having Finite Derivation Type is equivalent to the Homological Finiteness ConditionFP3
✍ ROBERT CREMANNS; FRIEDRICH OTTO 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 694 KB

The homological finiteness property F P 3 and the combinatorial property of having finite derivation type are both necessary conditions for finitely presented monoids to admit finite convergent presentations. For monoids in general, the property of having finite derivation type implies the property