𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edmonds polytopes and weakly hamiltonian graphs

✍ Scribed by Václav Chvátal

Publisher
Springer-Verlag
Year
1973
Tongue
English
Weight
409 KB
Volume
5
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interchange graphs and the Hamiltonian c
Interchange graphs and the Hamiltonian cycle polytope
✍ Gerard Sierksma 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 464 KB

This paper answers the (non)adjacency question for the whole spectrum of Hamiltonian cycles on the Hamiltonian cycle polytope (HC-polytope), also called the symmetric traveling salesman polytope, namely from Hamiltonian cycles that differ in only two edges through Hamiltonian cycles that are edge di

On the girth of hamiltonian weakly pancy
On the girth of hamiltonian weakly pancyclic graphs
✍ Bollob�s, B�la; Thomason, Andrew 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circumference. In answer to a question of Erdős, we show that a Hamiltonian weakly-pancyclic graph of order n can have girth as large as about 2 n/ log n. In contrast to this, we show that the existence of

A class of Hamiltonian polytopes
A class of Hamiltonian polytopes
✍ P. R. Goodey 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB

## Abstract It is shown that any simple 3‐polytope, all of whose faces are triangles or hexagons, admits a hamiltonian circuit.

Weakly pancyclic graphs
Weakly pancyclic graphs
✍ Brandt, Stephan; Faudree, Ralph; Goddard, Wayne 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 517 KB

In generalizing the concept of a pancyclic graph, we say that a graph is ''weakly pancyclic'' if it contains cycles of every length between the length of a shortest and a longest cycle. In this paper it is shown that in many cases the requirements on a graph which ensure that it is weakly pancyclic

Hamiltonian paths and hamiltonian connec
Hamiltonian paths and hamiltonian connectivity in graphs
✍ Bing Wei 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 388 KB

## Let G be a 2-connected graph with n vertices such that d(u)+d(u)+d(w)-IN(u)nN(u)nN(w)I an+ 1 holds for any triple of independent vertices u, v and w. Then for any distinct vertices u and u such that {u, 0) is not a cut vertex set of G, there is a hamiltonian path between u and o. In particular,