Search: -meta:BP550
|
| |
|
| BP390 |
| Each graph vertex is uniquely defined by its connections (the graph does not admit nontrivial automorphisms) vs. the graph admits nontrivial automorphisms. |
|
| |
|
| |
| |
|
|
| |
|
| BP391 |
| There exists an edge such that removing it yields two disconnected graphs (i.e., the minimum number of edges whose removal results in two disconnected graphs is 1) vs. the minimum number of edges whose removal results in two disconnected graphs is 2. |
|
| |
|
| |
| |
|
|
| |
|
| BP392 |
| Exponential increase vs. linear increase. |
|
| |
|
| |
| |
|
|
| |
|
| BP393 |
| Correct vs. incorrect. |
|
| |
|
| |
| |
|
|
| |
|
| BP394 |
| For each colored square only, there exists a path starting on it that covers each square of the figure exactly once vs. there is no path that starts on a colored square and covers each square of the figure exactly once. |
|
| |
|
| |
| |
|
|
| |
|
| BP395 |
| Objects share a feature inside & outside of a closed curve vs. not so. |
|
| |
|
| |
| |
|
|
| |
|
| BP396 |
| Objects share a feature in two regions of an open curve vs. not so. |
|
| |
|
| |
| |
|
|
| |
|
| BP397 |
| Objects share a feature in & out of dot-made closed curve vs. not so. |
|
| |
|
| |
| |
| |
|
|
|
|
|
|
|
|