{"product_id":"embeddability-in-graphs-von-liu-yanpei","title":"Embeddability in Graphs","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. \u003cbr\u003e  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. \u003cbr\u003e\n            \u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9789048145997\"\u003e\u003ch3\u003e\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9789048145997","offer_id":39528836890717,"sku":"9789048145997","price":106.99,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/0f74507f-10ed-411b-a412-3333865a9655.jpg?v=1761806491","url":"https:\/\/shop.autorenwelt.de\/products\/embeddability-in-graphs-von-liu-yanpei","provider":"Autorenwelt Shop","version":"1.0","type":"link"}