For the best experience, please enable Javascript
x
Warning - This version of Internet Explorer is out of date. It has known security flaws and may not display all features of this website correctly. Please consider updating this browser.

Planar Graphs: Theory and Algorithms

Planar Graphs: Theory and Algorithms

By: T. Nishizeki, N. Chiba

  • Book
  • Reg. Price › $15.95
  • Share this book:
  • Share on Google+

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-coloring, independent vertex sets, and subgraph listing. The text concludes with explorations of planar separator theorem, Hamiltonian cycles, and single-commodity or multi-commodity flows.

Reprint of the North-Holland, Amsterdam and New York, 1988 edition.
AvailabilityUsually ships in 24 to 48 hours
ISBN 10048646671X
ISBN 139780486466712
Author/EditorT. Nishizeki, N. Chiba
FormatBook
Page Count240
Dimensions5 3/8 x 8 1/2

You might also Like...

Product Review

Out of Stock Notification: