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 13667
Graph theory is the study of graphs, mathematical structures used to model pairwise relations between objects.
2
votes
Accepted
Graph Isomorphism: Polynomial time reduction from GI for disconnected graphs to GI for conne...
What about the following simple reduction: given graphs $G$ and $H$,
let $G' = G * g$ and $H' = H * h$, where $X * x$ is obtained from $X$ by adding a new
vertex $x$ and all edges between $x$ and al …
- 398
5
votes
Graphs in which every minimal separator is an independent set
There are two new papers on graphs without cycle having exactly one chord. Both mainly deal with coloring these graphs:
http://arxiv.org/abs/1309.2749 and http://arxiv.org/abs/1311.1928.
The later …
- 398
21
votes
3
answers
2k
views
Graphs in which every minimal separator is an independent set
Background:
Let $u, v$ be two vertices of an undirected graph $G=(V,E)$.
A vertex set $S\subseteq V$ is a $u,v$-separator if $u$ and $v$
belong to different connected components of $G-S$. If no proper …
- 398