Graph embedding: Difference between revisions

Revision as of 06:06, 26 September 2019

Revision as of 22:29, 11 October 2019

Line 25:

| volume = 894

| year = 1995| isbn = 978-3-540-58950-1

}}.</ref>. andA [[planar graphsgraph]] is one that can be embedded in 2-dimensional Euclidean space <math>\mathbb{R}^2.</math>

Often, an '''embedding''' is regarded as an equivalence class (under homeomorphisms of <math>\Sigma</math>) of representations of the kind just described.