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 3206
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.
2
votes
Making integer multisets graphic
I will think of $X$ as the set of allowed degree values, with largest value being $b$, and the total number of elements of $M$ to be $m$.
If $m=1$ with nonnegative value $b$ as the sole member, then …
- 3,209
2
votes
a colouring / matching problem
Since you are looking for finding a feasible solution of a particular instance in a relatively short time, I would combine a couple techniques.
I would start by doing some breadth first searches, ess …
- 3,209
2
votes
Enumerating all Hamiltonian Cycles in a Bipartite Vertex Transitive Graph
This is a list of suggestions, some of which may help.
First try smaller cases. For n=3 there is 1 cycle; for n=5 I don't know but I suspect it is a small multiple of 120. The nice thing is that fr …
- 3,209
2
votes
Minimizing distance on a graph by adding shortcuts
Let's look at what happens when you add an edge to a connected (simple, undirected and incomplete) graph G.
Let $N_d(v)$ denote that subset of the vertices of G that are a distance precisely $d$ (i.e …
- 3,209
0
votes
Can we map every graph in the plane such that all induced cycles selfintersect?
It will be hard to do with complete graphs or near complete. Bipartite graphs come close; perhaps you could try some characterization involving near-bipartite graphs.
Of course, you can artificially …
- 3,209