𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Weakly symmetric graphs, elementary landscapes, and the TSP

✍ Scribed by A. Solomon; J.W. Barnes; S.P. Dokov; R. Acevedo

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
365 KB
Volume
16
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The symmetric (2k, k)-graphs
The symmetric (2k, k)-graphs
✍ Matthias Kriesell πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 166 KB πŸ‘ 1 views
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