Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:characterizedBy |
absence of K5 and K3,3 as minors
|
| gptkbp:definedIn |
a graph that can be embedded in the plane so that its edges intersect only at their endpoints
|
| gptkbp:example |
gptkb:tree
gptkb:complete_bipartite_graph_K3,3 gptkb:complete_graph_K5 cycle graph |
| gptkbp:hasProperty |
can be drawn on a plane without edge crossings
|
| https://www.w3.org/2000/01/rdf-schema#label |
planar graph
|
| gptkbp:maximumEdges |
3n-6 for n>=3
|
| gptkbp:relatedTo |
gptkb:Four_color_theorem
gptkb:Euler's_formula gptkb:Kuratowski's_theorem planar separator theorem planar embedding nonplanar graph planar dual |
| gptkbp:studiedIn |
graph theory
|
| gptkbp:usedIn |
gptkb:data_visualization
geography circuit design |
| gptkbp:bfsParent |
gptkb:graph
|
| gptkbp:bfsLayer |
5
|