Finally there is a book that presents real applications of graph theory in a unified format. This book is the only source for an extended, concentrated focus on the theory and techniques common to various types of intersection graphs. It is a concise treatment of the aspects of intersection graphs that interconnect many standard concepts and form the foundation of a surprising array of applications to biology, computing, psychology, matrices, and statistics.

From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way,

Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory.

This book considers a number of research topics in graph theory and its applications, including ideas devoted to alpha-discrepancy, strongly perfect graphs, reconstruction conjectures, graph invariants, hereditary classes of graphs, and embedding graphs on topological surfaces. It also discusses applications of graph theory, such as transport networks and hazard assessments based on unified networks. The book is ideal for developers of grant proposals and researchers interested in exploring new areas of graph theory and its applications.

There is no other book with such a wide scope of both areas of algebraic graph theory.

The interplay continues to grow between graph theory and a wide variety of models and applications in mathematics, computer science, operations research, and the natural and social sciences. Topics in Graph Theory is geared toward the more mathematically mature student. The first three chapters provide the basic definitions and theorems of graph theory and the remaining chapters introduce a variety of topics and directions for research. These topics draw on numerous areas of theoretical and applied mathematics, including combinatorics, probability, linear algebra, group theory, topology, operations research, and computer science. This makes the book appropriate for a first course at the graduate level or as a second course at the undergraduate level. The authors build upon material previously published in Graph Theory and Its Applications, Third Edition, by the same authors. That text covers material for both an undergraduate and graduate course, while this book builds on and expands the graduate-level material. Features Extensive exercises and applications. Flexibility: appropriate for either a first course at the graduate level or an advanced course at the undergraduate level. Opens avenues to a variety of research areas in graph theory. Emphasis on topological and algebraic graph theory.

Chromatic graph theory is a thriving area that uses various ideas of 'colouring' (of vertices, edges, and so on) to explore aspects of graph theory. It has links with other areas of mathematics, including topology, algebra and geometry, and is increasingly used in such areas as computer networks, where colouring algorithms form an important feature. While other books cover portions of the material, no other title has such a wide scope as this one, in which acknowledged international experts in the field provide a broad survey of the subject. All fifteen chapters have been carefully edited, with uniform notation and terminology applied throughout. Bjarne Toft (Odense, Denmark), widely recognized for his substantial contributions to the area, acted as academic consultant. The book serves as a valuable reference for researchers and graduate students in graph theory and combinatorics and as a useful introduction to the topic for mathematicians in related fields.