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 answers only
not deleted
user 468
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
Growth polynomial of the Associahedron graph ? (Is it approximately Gaussian ?)
Let's consider the associahedron whose vertices are triangulations of an $n$-gon. Sleator, Tarjan, and Thurston (Rotation distance, triangulations, and hyperbolic geometry, JAMS, 1988)
give a simple a …
- 6,302
2
votes
Accepted
Hadwiger critical graphs of arbitrarily high chromatic number
This is a generalization of Bjørn Kjos-Hanssen's answer to your previous question.
Take $K_{n+2}$ and remove two edges between two different pairs of vertices, say $(1,2)$ and $(3,4)$ The chromatic …
- 6,302