Further results on snakes in powers of complete graphs
β Scribed by H.L. Abbott; M. Katchalski
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 553 KB
- Volume
- 91
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 the case where G is the product of d copies of the complete graph on n vertices.
π SIMILAR VOLUMES
## Abstract Let __G__ be a graph on __p__ vertices. Then for a positive integer __n__, __G__ is said to be __n__βextendible if (i) __n__ < __p__/2, (ii) __G__ has a set of __n__ independent edges, and (iii) every such set is contained in a perfect matching of __G__. The purpose of this article is t
Shee, S.-C., Some results on I-valuation of graphs involving complete bipartite graphs, Discrete Mathematics 87 (1991) 73-80. In this paper we show that a graph G obtained from a complete bipartite graph K,,, and a collection of q (cmax{m, n}) stars G, by joining the centre of G, to every vertex of
## Abstract It is known that a necessary condition for the existence of a 1βrotational 2βfactorization of the complete graph __K__~2__n__+1~ under the action of a group __G__ of order 2__n__ is that the involutions of __G__ are pairwise conjugate. Is this condition also sufficient? The complete ans