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 11142
graphs that can be embedded into the plane, i.e. that can be drawn without crossings between the lines representing edges.
1
vote
Cholesky factorization of planar graphs
Yes. As this book chapter (by S. Toledo) shows, the number of arithmetic operations is bounded by the sum over the non-zero columns of the squares of the numbers of nonzero elements therein. The sum o …
- 96.4k
8
votes
Accepted
In how many ways can a given planar graph be mapped into the plane?
It is a theorem of Whitney, that a $3$-connected planar graph has two planar embeddings (one being the other flipped over). If a graph is two-connected, then you can flip over some, but not all of the …
- 96.4k