By T. Nishizeki

This booklet beneficial properties lots of the very important theorems and algorithms regarding planar graphs. Eminently appropriate as a textual content, it is also valuable for researchers and contains an in depth reference section.
The authors, who've researched planar graphs for a few years, have established the themes in a way correct to graph theorists and machine scientists. the 1st chapters are introductory and supply the rules of the graph theoretic notions and algorithmic suggestions used through the textual content. Succeeding chapters talk about planarity checking out and embedding, drawing planar graphs, vertex- and edge-coloring, self sustaining vertex units, and subgraph directory. The textual content concludes with explorations of planar separator theorem, Hamiltonian cycles, and single-commodity or multi-commodity flows.

Show description

Read Online or Download Planar Graphs: Theory and Algorithms (Dover Books on Mathematics) PDF

Similar Graph Theory books

Fixed Point Theory and Graph Theory: Foundations and Integrative Approaches

Mounted element conception and Graph concept presents an intersection among the theories of mounted element theorems that provide the stipulations less than which maps (single or multivalued) have suggestions and graph idea which makes use of mathematical constructions to demonstrate the connection among ordered pairs of items by way of their vertices and directed edges.

Random Geometric Graphs (Oxford Studies in Probability)

This monograph offers and explains the maths at the back of geometric graph thought, which experiences the homes of a graph that comprises nodes put in Euclidean area in order that edges might be additional to attach issues which are on the subject of each other. for instance, a set of timber scattered in a wooded area and the illness that's handed among them, a collection of nests of animals or birds on a zone and the communique among them or verbal exchange among communications stations or nerve cells.

Matroid Theory (Oxford Graduate Texts in Mathematics)

* what's the essence of the similarity among linearly self sustaining units of columns of a matrix and forests in a graph? * Why does the grasping set of rules produce a spanning tree of minimal weight in a attached graph? * will we try out in polynomial time no matter if a matrix is completely unimodular? Matroid thought examines and solutions questions like those.

The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators

This e-book presents an exhilarating historical past of the invention of Ramsey idea, and comprises new study in addition to infrequent photos of the mathematicians who built this thought, together with Paul Erdös, B. L. van der Waerden, and Henry Baudet.

Additional resources for Planar Graphs: Theory and Algorithms (Dover Books on Mathematics)

Show sample text content

Rated 4.20 of 5 – based on 38 votes