Graph Theory is a part of discrete mathematics characterized by the fact of an extremely rapid development during the last 10 years. The number of graph theoretical paper as well as the number of graph theorists increase very strongly. The main purpose of this book is to show the reader the variety of graph theoretical methods and the relation to combinatorics and to give him a survey on a lot of new results, special methods, and interesting informations. This book, which grew out of contributions given by about 130 authors in honour to the 70th birthday of Gerhard Ringel, one of the pioneers in graph theory, is meant to serve as a source of open problems, reference and guide to the extensive literature and as stimulant to further research on graph theory and combinatorics.6. Any tree T with A(T) alt; 5 can be embedded into its optimal hypercube with dilation 2. Let us note that the condition A(T) alt; 5 on the ... into its optimal hypercube with dilation 27 (If Conj. 6 holds, the answer is positive). 1. 2. 3. 10. 11. 12. 13. 14.
|Title||:||Topics in Combinatorics and Graph Theory|
|Author||:||Rainer Bodendiek, Rudolf Henn|
|Publisher||:||Springer Science & Business Media - 2012-12-06|