Embeddability in Graphs
20%
off

Embeddability in Graphs

By (author) 

Free delivery worldwide

Available. Dispatched from the UK in 3 business days
When will my order arrive?

Description

This monograph provides a theoretical treatment of the problems related to the embeddability of graphs. Among these problems are the planarity and planar embeddings of a graph, the Gaussian crossing problem, the isomorphisms of polyhedra, surface embeddability, problems concerning graphic and cographic matroids and the knot problem from topology to combinatorics are discussed. Rectilinear embeddability, and the net-embeddability of a graph, which appears from the VSLI circuit design and has been much improved by the author recently, is also illustrated. Furthermore, some optimization problems related to planar and rectilinear embeddings of graphs, including those of finding the shortest convex embedding with a boundary condition and the shortest triangulation for given points on the plane, the bend and the area minimizations of rectilinear embeddings, and several kinds of graph decompositions are specially described for conditions efficiently solvable.
At the end of each chapter, the Notes Section sets out the progress of related problems, the background in theory and practice, and some historical remarks. Some open problems with suggestions for their solutions are mentioned for further research.
show more

Product details

  • Hardback | 398 pages
  • 155 x 235 x 23.88mm | 1,680g
  • Dordrecht, Netherlands
  • English
  • 1996 ed.
  • XVI, 398 p.
  • 0792336488
  • 9780792336488

Table of contents

Preface. 1. Preliminaries. 2. Trees in Graphs. 3. Spaces in Graphs. 4. Planar Graphs. 5. Planarity. 6. Gauss Crossing Problem. 7. Planar Embeddings. 8. Rectilinear Embeddability. 9. Net Embeddability. 10. Isomorphisms in Polyhedra. 11. Decompositions of Graphs. 12. Surface Embeddability. 13. Extremal Problems. 14. Graphic and Cographic Matroids. 15. Invariants on Knots. References. Index.
show more