Planar Graphs

Theory and Algorithms

By: T Nishizeki, N Chiba

Write A Review

Paperback | 11 June 2008

At a Glance

Paperback
232 Pages

Dimensions(cm)
21.6 x 13.8 x 1.3

Paperback

$33.75

or 4 interest-free payments of $8.44 with

Ships in 5 to 10 business days

This book features most of the important theorems and algorithms related to planar graphs. Eminently suitable as a text, it also is useful for researchers and includes an extensive reference section. The authors, who have researched planar graphs for many years, have structured the topics in a manner relevant to graph theorists and computer scientists. The first two chapters are introductory and provide the foundations of the graph theoretic notions and algorithmic techniques used throughout the text. Succeeding chapters discuss planarity testing and embedding, drawing planar graphs, vertex- and edge-colouring, independent vertex sets, and subgraph listing. The text concludes with explorations of planar separator theorem, Hamiltonian cycles, and single-commodity or multi-commodity flows.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $89.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.