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 6634
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
Accepted
Decomposition of a regular graph and connected subgraphs
Edit: How about this counterexample for the case $s_2,t_2>0$:
$G=(V,E)$ with $V=\{x_1\}\cup\{u_i^k\ |\ 1\le i\le n,1\le k\le 4\}$, and $E$ being the union of
$\{(x_1,u_i^k)\ |\ 1\le i\le n, k\in\{1 …
- 378
4
votes
Find all faces in a graph from list of edges
Expanding a bit on the comments to Federico's answer: If the neighbors of each vertex are listed in counterclockwise order, this defines an embedding on a surface, and if this information was obtained …
- 378