Siirry suoraan sisältöön
Embeddability in Graphs
Tallenna

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.
Kirjailija
Liu Yanpei
Painos
1st ed. Softcover of orig. ed. 1996
ISBN
9789048145997
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
4.12.2010
Kustantaja
Springer
Sivumäärä
398