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 topological-graph-theory
Search options answers only
not deleted
user 25980
Graph theoretical questions with a topological flavour. For example, graphs on surfaces, spatial embeddings, and geometric graphs. Use the graph-drawing tag for questions specific to graph drawing (e.g. crossing numbers).
10
votes
Do there exist sparse graphs with large crossing number?
The complete bipartite graph $K_{3,n}$ has 3n edges and crossing number $cn^2$.
- 1,319
4
votes
Why are planar graphs so exceptional?
Planar graphs answer many important questions in graph structure theory.
Example 1. H-minor-free graphs have bounded treewidth if and only if H is planar.
Example 2. The set of graphs contractible …
- 1,319
3
votes
Embedding planar graphs into the grid
There is a huge literature on this topic. Search for "orthogonal graph drawing". The best possible area bound is $O(n^2)$.
- 1,319
1
vote
Let $G$ be a graph of genus $g$. Is the number of (non necessarily disjoint) 5-clique subgra...
Say $\gamma(G)$ is the genus of a graph $G$. If $G$ has components $G_1,\dots,G_c$ then $\gamma(G)=\sum_{i=1}^c \gamma(G_i)$. This property is called the additivity of genus (and much stronger results …
- 1,319