planarer Graph
Sign in to saveGraph, der in der Ebene kreuzungsfrei (ohne Überschneidungen von Kanten außer in gemeinsamen Knoten) gezeichnet werden kann
In the Vinony graph
Within Vinony's link graph, planarer Graph is referenced by 480 other articles, and connects out to graph, homeomorphism and three utilities problem.
It is catalogued under topics including Graph families, Intersection classes of graphs and Planar graphs.
Its subject is documented across 34 Wikipedia language editions.
Wikidata facts
- Image
- Urquhart graph.svg
Show 7 more facts
- studied by
- graph theory
- described by source
- Kuratowski's theorem
- Commons category
- Planar graphs
- topic's main category
- Category:Planar graphs
- maintained by WikiProject
- WikiProject Mathematics
- has characteristic
- crossing number
- Stack Exchange tag
- cstheory.stackexchange.com/tags/planar-graphs
Sources (2)
via Wikidata · CC0
Article · Deutsch
Ein planarer oder plättbarer Graph ist in der Graphentheorie ein Graph, der auf einer Ebene, mit Punkten für die Knoten und Linien für die Kanten, dargestellt werden kann, sodass sich keine Kanten schneiden.
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
graph
Entity
homeomorphism
Entity
three utilities problem
Entity
glossary of graph theory terms
Entity
graph embedding
Entity
forbidden graph characterization
Entity
International Standard Book Number
Entity
algorithm
Entity
sphere
Entity
digital object identifier
Entity
plane
Entity
graph theory
Entity
three-dimensional space
Entity
line segment
Entity
polyhedron
Entity
mathematical induction
Entity
torus
Entity
printed circuit board
Entity
JSTOR
Organization
bibcode
Entity