Gå direkte til innholdet
Embeddability in Graphs
Spar

Embeddability in 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.
Forfatter
Liu Yanpei
Opplag
1st ed. Softcover of orig. ed. 1996
ISBN
9789048145997
Språk
Engelsk
Vekt
310 gram
Utgivelsesdato
4.12.2010
Forlag
Springer
Antall sider
398