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 12858
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.
4
votes
Accepted
Is a graph with edges between edges and nodes still a graph?
I'm not aware of a name for such an object, but it can easily be modeled by a single vertex-colored directed graph $\Gamma$:
As vertex set of $\Gamma$, take the union of the vertices and edges of you …
- 6,614
4
votes
Accepted
article by Jacques Tits about automorphism group of a locally finite tree
This is true if the action of the automorphism group is edge-transitive (so in particular the tree has to be biregular). This is precisely the statement of Lemma 2.6(vii and viii) of our paper "Simple …
- 6,614