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 graph-theory
Search options not deleted
user 108318
Questions about the branch of combinatorics called graph theory (not to be used for questions concerning the graph of a function). This tag can be further specialized via using it in combination with more specialized tags such as extremal-graph-theory, spectral-graph-theory, algebraic-graph-theory, topological-graph-theory, random-graphs, graph-colorings and several others.
1
vote
Crossing number of some Sphere of Influence Graphs and relation to their coloring number
I believe that it's not the direction after all. If we look at the geometric question than we get the there exists no such k (the proof is very trivial, take unbounded connected components of 4 inters …
2
votes
2
answers
186
views
Crossing number of some Sphere of Influence Graphs and relation to their coloring number
My motivation is to apply some graph theoretic methods in real analysis (like in a simple proof that every open real set $ A $ is coutable union of disjoint graph - take the connected component of the …