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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Book by Liu Yanpei
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Second Story Books, ABAA, Rockville, MD, U.S.A.
Hardcover. Octavo, 398 pages. In Very Good minus condition. Yellow spine with brown text. Boards have rubbing to corners and light sunning to spine. Textblock clean. NOTE: Shelved in Netdesk Column R (ND-R). 1377334. FP New Rockville Stock. Codice articolo 1377334
Quantità: 1 disponibili
Da: Basi6 International, Irving, TX, U.S.A.
Condizione: Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days. Excellent Customer Service. Codice articolo POD-155981
Quantità: 10 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 6172108-n
Quantità: Più di 20 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9780792336488
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9780792336488_new
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 6172108-n
Quantità: Più di 20 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 420. Codice articolo 26547269
Quantità: 4 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 420 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Codice articolo 8381978
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 420. Codice articolo 18547279
Quantità: 4 disponibili
Da: moluna, Greven, Germania
Gebunden. Condizione: New. 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 embedda. Codice articolo 458438860
Quantità: Più di 20 disponibili