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 1492
graphs that can be embedded into the plane, i.e. that can be drawn without crossings between the lines representing edges.
10
votes
Accepted
Generating 21-vertex 4-regular plane graphs with 8 faces of degree 3 and 15 faces of degree 4
Brinkmann and McKay's program plantri can generate planar quadrangulations, which are planar graphs with all faces of size 4.
If you generate these on 23 vertices and then filter to keep only those of …
- 12.7k
3
votes
Accepted
Can Tutte embedding be guaranteed that each face is convex?
I think that for a 3-connected planar graph, any Tutte embedding has all faces represented as convex polygons.
In the linked paper, Tutte says (page 759, before (9.3)) that a barycentric mapping is a …
- 12.7k