Welcome guest
You're not logged in.
305 users online, thereof 0 logged in

Definition: Planar Graph

Let \(G(V,E,\gamma)\) be an undirected graph. \(G\) is called planar, if there exists a planar drawing for this graph.

Example:

A planar graph (left) with its planar embedding (right):

A graph, which is not planar:

| | | | | created: 2015-04-10 10:55:43 | modified: 2017-01-20 08:43:51 | by: bookofproofs | references: [1163]

1.Theorem: Euler Characteristic for Planar Graphs

2.Definition: Face, Infinite Face

3.Definition: Dual Planar Graph


This work was contributed under CC BY-SA 3.0 by:

This work is a derivative of:

(none)

Bibliography (further reading)

[1163] Diestel, Reinhard: “Graph Theory, 3rd Edition”, Springer, 2005

FeedsAcknowledgmentsTerms of UsePrivacy PolicyImprint
© 2018 Powered by BooOfProofs, All rights reserved.