𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Snakes in Powers of Complete Graphs

✍ Scribed by H. L. Abbott and P. F. Dierker

Book ID
124874513
Publisher
Society for Industrial and Applied Mathematics
Year
1977
Tongue
English
Weight
704 KB
Volume
32
Category
Article
ISSN
0036-1399

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Snakes in Powers of Complete Graphs
Snakes in Powers of Complete Graphs
✍ Abbott, H. L.; Dierker, P. F. πŸ“‚ Article πŸ“… 1977 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 867 KB
On constructing snakes in powers of comp
On constructing snakes in powers of complete graphs
✍ Jerzy Wojciechowski πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 737 KB

We prove the conjecture of Abbott and Katchalski that for every m ~> 2 there is a positive constant 2,. such that S(K~n ) >~ 2mnd-lS(Ka~ -1) where S(Ka~) is the length of the longest snake (cycle without chords) in the cartesian product K~ of d copies of the complete graph Kin. As a corollary, we co

Further results on snakes in powers of c
Further results on snakes in powers of complete graphs
✍ H.L. Abbott; M. Katchalski πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 553 KB

Abbott, H.L. and M. Katchalski, Further results on snakes in powers of complete graphs, Discrete Mathematics 91 (1991) 111-120. By a snake in a finite graph G is meant a cycle without chords. Denoted by S(G) the length of a longest snake in G. In this paper we obtain a new lower bound for S(G) in t

Simplicial powers of graphs
Simplicial powers of graphs
✍ Andreas BrandstΓ€dt; Van Bang Le πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 898 KB