Graph theory is one of the fastest growing branches of mathematics. Until recently, it was regarded as a branch of combinatorics and was best known by the famous four-color theorem stating that any map can be colored using only four colors such that no two bordering countries have the same color. Now graph theory is an area of its own with many deep results and beautiful open problems. Graph theory has numerous applications in almost every field of science and has attracted new interest because of its relevance to such technological problems as computer and telephone networking and, of course, the internet. In this new book in the Johns Hopkins Studies in the Mathematical Science series, Bojan Mohar and Carsten Thomassen look at a relatively new area of graph theory: that associated with curved surfaces. Graphs on surfaces form a natural link between discrete and continuous mathematics. The book provides a rigorous and concise introduction to graphs on surfaces and surveys some of the recent developments in this area. Among the basic results discussed are Kuratowski's theorem and other planarity criteria, the Jordan Curve Theorem and some of its extensions, the classification of surfaces, and the Heffter-Edmonds-Ringel rotation principle, which makes it possible to treat graphs on surfaces in a purely combinatorial way. The genus of a graph, contractability of cycles, edge-width, and face-width are treated purely combinatorially, and several results related to these concepts are included. The extension by Robertson and Seymour of Kuratowski's theorem to higher surfaces is discussed in detail, and a shorter proof is presented. The book concludes with a survey of recent developments on coloring graphs on surfaces.

Graphs drawn on two-dimensional surfaces have always attracted researchers by their beauty and by the variety of difficult questions to which they give rise. The theory of such embedded graphs, which long seemed rather isolated, has witnessed the appearance of entirely unexpected new applications in recent decades, ranging from Galois theory to quantum gravity models, and has become a kind of a focus of a vast field of research. The book provides an accessible introduction to this new domain, including such topics as coverings of Riemann surfaces, the Galois group action on embedded graphs (Grothendieck's theory of "dessins d'enfants"), the matrix integral method, moduli spaces of curves, the topology of meromorphic functions, and combinatorial aspects of Vassiliev's knot invariants and, in an appendix by Don Zagier, the use of finite group representation theory. The presentation is concrete throughout, with numerous figures, examples (including computer calculations) and exercises, and should appeal to both graduate students and researchers.

Graphs on Surfaces: Dualities, Polynomials, and Knots offers an accessible and comprehensive treatment of recent developments on generalized duals of graphs on surfaces, and their applications. The authors illustrate the interdependency between duality, medial graphs and knots; how this interdependency is reflected in algebraic invariants of graphs and knots; and how it can be exploited to solve problems in graph and knot theory. Taking a constructive approach, the authors emphasize how generalized duals and related ideas arise by localizing classical constructions, such as geometric duals and Tait graphs, and then removing artificial restrictions in these constructions to obtain full extensions of them to embedded graphs. The authors demonstrate the benefits of these generalizations to embedded graphs in chapters describing their applications to graph polynomials and knots. Graphs on Surfaces: Dualities, Polynomials, and Knots also provides a self-contained introduction to graphs on surfaces, generalized duals, topological graph polynomials, and knot polynomials that is accessible both to graph theorists and to knot theorists. Directed at those with some familiarity with basic graph theory and knot theory, this book is appropriate for graduate students and researchers in either area. Because the area is advancing so rapidly, the authors give a comprehensive overview of the topic and include a robust bibliography, aiming to provide the reader with the necessary foundations to stay abreast of the field. The reader will come away from the text convinced of advantages of considering these higher genus analogues of constructions of plane and abstract graphs, and with a good understanding of how they arise.

Homology theory is a powerful algebraic tool that is at the centre of current research in topology and its applications. This accessible textbook will appeal to mathematics students interested in the application of algebra to geometrical problems, specifically the study of surfaces (sphere, torus, Mobius band, Klein bottle). In this introduction to simplicial homology - the most easily digested version of homology theory - the author studies interesting geometrical problems, such as the structure of two-dimensional surfaces and the embedding of graphs in surfaces, using the minimum of algebraic machinery and including a version of Lefschetz duality. Assuming very little mathematical knowledge, the book provides a complete account of the algebra needed (abelian groups and presentations), and the development of the material is always carefully explained with proofs given in full detail. Numerous examples and exercises are also included, making this an ideal text for undergraduate courses or for self-study.

The field of topological graph theory has expanded greatly in the ten years since the first edition of this book appeared. The original nine chapters of this classic work have therefore been revised and updated. Six new chapters have been added, dealing with: voltage graphs, non-orientable imbeddings, block designs associated with graph imbeddings, hypergraph imbeddings, map automorphism groups and change ringing.Thirty-two new problems have been added to this new edition, so that there are now 181 in all; 22 of these have been designated as ``difficult'' and 9 as ``unsolved''. Three of the four unsolved problems from the first edition have been solved in the ten years between editions; they are now marked as ``difficult''.

The use of topological ideas to explore various aspects of graph theory, and vice versa, is a fruitful area of research. There are links with other areas of mathematics, such as design theory and geometry, and increasingly with such areas as computer networks where symmetry is an important feature. Other books cover portions of the material here, but there are no other books with such a wide scope. This book contains fifteen expository chapters written by acknowledged international experts in the field. Their well-written contributions have been carefully edited to enhance readability and to standardize the chapter structure, terminology and notation throughout the book. To help the reader, there is an extensive introductory chapter that covers the basic background material in graph theory and the topology of surfaces. Each chapter concludes with an extensive list of references.

Stimulating and accessible, this undergraduate-level text covers basic graph theory, colorings of graphs, circuits and cycles, labeling graphs, drawings of graphs, measurements of closeness to planarity, graphs on surfaces, and applications and algorithms. 1994 edition.

With Chromatic Graph Theory, Second Edition, the authors present various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. Readers will see that the authors accomplished the primary goal of this textbook, which is to introduce graph theory with a coloring theme and to look at graph colorings in various ways. The textbook also covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings. Features of the Second Edition: The book can be used for a first course in graph theory as well as a graduate course The primary topic in the book is graph coloring The book begins with an introduction to graph theory so assumes no previous course The authors are the most widely-published team on graph theory Many new examples and exercises enhance the new edition

In 1890 P. J. Heawood [35] published a formula which he called the Map Colour Theorem. But he forgot to prove it. Therefore the world of mathematicians called it the Heawood Conjecture. In 1968 the formula was proven and therefore again called the Map Color Theorem. (This book is written in California, thus in American English. ) Beautiful combinatorial methods were developed in order to prove the formula. The proof is divided into twelve cases. In 1966 there were three of them still unsolved. In the academic year 1967/68 J. W. T. Youngs on those three cases at Santa Cruz. Sur invited me to work with him prisingly our joint effort led to the solution of all three cases. It was a year of hard work but great pleasure. Working together was extremely profitable and enjoyable. In spite of the fact that we saw each other every day, Ted wrote a letter to me, which I present here in shortened form: Santa Cruz, March 1, 1968 Dear Gerhard: Last night while I was checking our results on Cases 2, 8 and 11, and thinking of the great pleasure we had in the afternoon with the extra ordinarily elegant new solution for Case 11, it seemed to me appropriate to pause for a few minutes and dictate a historical memorandum. We began working on Case 8 on 10 October 1967, and it was settled on Tuesday night, 14 November 1967.

Aimed at "the mathematically traumatized," this text offers nontechnical coverage of graph theory, with exercises. Discusses planar graphs, Euler's formula, Platonic graphs, coloring, the genus of a graph, Euler walks, Hamilton walks, more. 1976 edition.