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 477519
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
Are these inclusions between graph classes correct? for ISGCI
Replaced earlier answer, which used an incorrect definition of interval filament graphs.
Unipolar graphs are interval filaments graphs. Brief sketch: If $G$ is unipolar there are vertex sets $A$ and $ …
- 61
4
votes
"Gluing and copy" graphs
This class is the same as the $\Delta$-confluent graphs introduced by Eppstein, Goodrich, and Meng (Delta-confluent Drawings). It is easy to see that $\Delta$-confluent graphs are closed under the ope …
- 61