Embeddability in Graphs
Liu Yanpei
Broschiertes Buch

Embeddability in Graphs

Versandkostenfrei!
Versandfertig in 1-2 Wochen
77,99 €
inkl. MwSt.
PAYBACK Punkte
39 °P sammeln!
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 ...