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 11260
graphs that can be embedded into the plane, i.e. that can be drawn without crossings between the lines representing edges.
6
votes
Accepted
The origin of a planar graph theorem of Steinitz and Rademacher
According to Frank Lutz's article it's in paragraph 46 of the Steinitz-Rademacher book: "every triangulated 2-sphere can be reduced to the boundary of the tetrahedron by a sequence of edge contraction …
- 188k
9
votes
Accepted
Has Plummer's open problem on the cyclic connectivity of planar graphs been solved?
Yes, it has been solved.
In 1989 Borodin proved that the maximum cyclic edge connectivity of a 5-connected planar graph is at most 11, improving on Plummer's upper bound of 13. The 11 bound is tight [ …
- 188k
2
votes
Accepted
Who introduced the concept of beyond planar graphs?
A pre-Dagstuhl reference is
Graph drawing beyond planarity: some results and open problems.
G Liotta,ICTCS 14, 3-8 (2014).
The “beyond planarity” research area could be briefly described as the
(pote …
- 188k