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 7092
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.
3
votes
1
answer
108
views
Has this random process been studied on grid graphs?
As an offshoot of a different discussion I got curious about (uniform) random spanning trees on grid graphs (torus graphs in particular, to avoid having to think about edge effects) and what their dia …
- 8,992
0
votes
What is the proper name for this "tersest path" problem in Infinite Craft?
I am embarrassed not to have recognized this sooner, but a 'canonical' structure that models Infinite Craft is the Commutative Magma — definitionally, a set $S$ with a binary operation $\oplus$ that i …
- 1,951
3
votes
1
answer
1k
views
Is there a promise version of 3-coloring equivalent to Graph Isomorphism?
The discussion at Decision problem restricted to inputs that satisfy some necessary condition. got me thinking about specific promises on a graph that would reduce the complexity of the coloring probl …
CommunityBot
- 1