Crossing Numbers of Graphs is the first book devoted to the crossing number, an increasingly popular object of study with surprising connections. The field has matured into a large body of work, which includes identifiable core results and techniques. The book presents a wide variety of ideas and techniques in topological graph theory, discrete geometry, and computer science. The first part of the text deals with traditional crossing number, crossing number values, crossing lemma, related parameters, computational complexity, and algorithms. The second part includes the rich history of alternative crossing numbers, the rectilinear crossing number, the pair crossing number, and the independent odd crossing number.It also includes applications of the crossing number outside topological graph theory. Aimed at graduate students and professionals in both mathematics and computer science The first book of its kind devoted to the topic Authored by a noted authority in crossing numbers

No detailed description available for "Type crossings".

The technique of diagrammatic morphisms is an important ingredient in comprehending and visualizing certain types of categories with structure. It was widely used in this capacity in many areas of algebra, low-dimensional topology and physics. It was also applied to problems in classical and quantum information processing and logic. This volume contains articles based on talks at the Special Session, ``Diagrammatic Morphisms in Algebra, Category Theory, and Topology'', at the AMS Sectional Meeting in San Francisco. The articles describe recent achievements in several aspects of diagrammatic morphisms and their applications. Some of them contain detailed expositions on various diagrammatic techniques. The introductory article by D. Yetter is a thorough account of the subject in a historical perspective.

This book constitutes the revised selected papers of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011, held at Teplá Monastery, Czech Republic, in June 2011. The 28 revised papers presented were carefully reviewed and selected from 52 submissions. The workshop aims at merging theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, and by extracting new graph theoretic problems from applications.