Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with planar-graphs
Search options answers only
not deleted
user 440
graphs that can be embedded into the plane, i.e. that can be drawn without crossings between the lines representing edges.
9
votes
Is a distributive lattice planar iff it admits no B3 sublattice?
It's already been answered positively, but here's another argument that shows something a little stronger: every finite distributive lattice either contains a B3 (and is not planar) or it can be drawn …
- 18.6k
6
votes
Generalizations of Planar Graphs
Another possibility is a family of concepts related to thickness: the minimum number of colors one needs to color the edges in a drawing of the graph in the plane such that edges of the same color do …
- 18.6k
15
votes
Generalizations of Planar Graphs
There are many generalizations, but one of my favorites is "neighborhood systems": intersection graphs of systems of balls in a Euclidean space of bounded dimension, with the property that any point o …
- 18.6k
5
votes
Accepted
Planar layouts of bipartite graphs
Any planar graph can be drawn with curves for the edges and its vertices in any position in the plane.
But with straight line segment edges, it's not always possible, even for graphs in which every ve …
- 18.6k