In 1937 there appeared a paper that was to have a profound influence on the progress of combinatorial enumeration, both in its theoretical and applied aspects. Entitled Kombinatorische Anzahlbest immungen jUr Gruppen, Graphen und chemische Verbindungen, it was published in Acta Mathematica, Vol. 68, pp. 145 to 254. Its author, George Polya, was already a mathematician of considerable stature, well-known for outstanding work in many branches of mathematics, particularly analysis. The paper in Question was unusual in that it depended almost entirely on a single theorem -- the "Hauptsatz" of Section 4 -- a theorem which gave a method for solving a general type of enumera tion problem. On the face of it, this is not something that one would expect to run to over 100 pages. Yet the range of the applica tions of the theorem and of its ramifications was enormous, as Polya clearly showed. In the various sections of his paper he explored many applications to the enumeration of graphs, principally trees, and of chemical isomers, using his theorem to present a comprehen sive and unified treatment of problems which had previously been solved, if at all, only by ad hoc methods. In the final section he investigated the asymptotic properties of these enumerational results, bringing to bear his formidable insight as an analyst

This volume contains selected papers presented at the Spring School and International Conference on Combinatorics. Topics discussed include: Enumeration, Design, Graphs, Hypergraphs and Combinatorial Optimization, etc. Covering a broad range, this book should appeal to a wide spectrum of researchers in combinatorics and graph theory.

Advanced Graph Theory focuses on some of the main notions arising in graph theory with an emphasis from the very start of the book on the possible applications of the theory and the fruitful links existing with linear algebra. The second part of the book covers basic material related to linear recurrence relations with application to counting and the asymptotic estimate of the rate of growth of a sequence satisfying a recurrence relation.

These notes were first used in an introductory course team taught by the authors at Appalachian State University to advanced undergraduates and beginning graduates. The text was written with four pedagogical goals in mind: offer a variety of topics in one course, get to the main themes and tools as efficiently as possible, show the relationships between the different topics, and include recent results to convince students that mathematics is a living discipline.

This book presents interdisciplinary, cutting-edge and creative applications of graph theory and modeling in science, technology, architecture and art. Topics are divided into three parts: the first one examines mechanical problems related to gears, planetary gears and engineering installations; the second one explores graph-based methods applied to medical analyses as well as biological and chemical modeling; and the third part includes various topics e.g. drama analysis, aiding of design activities and network visualisation. The authors represent several countries in Europe and America, and their contributions show how different, useful and fruitful the utilization of graphs in modelling of engineering systems can be. The book has been designed to serve readers interested in the subject of graph modelling and those with expertise in related areas, as well as members of the worldwide community of graph modelers.