Gå direkt till innehållet
Embeddability in Graphs
Spara

Embeddability in Graphs

Lägsta pris på PriceRunner
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.
Författare
Liu Yanpei
Upplaga
1st ed. Softcover of orig. ed. 1996
ISBN
9789048145997
Språk
Engelska
Vikt
310 gram
Utgivningsdatum
2010-12-04
Förlag
Springer
Sidor
398