| Hint | Answer | % Correct |
|---|---|---|
| A graph in which the vertices can be split into two groups; such that every edge joins a vertex from one group to a vertex of the other group | bipartite graph | 100%
|
| Any edge in which, when removed leaves the graph disconnected | bridge | 100%
|
| A path starting and finishing at the same vertex | closed path(cycle) | 100%
|
| A walk starting and finishing at the same vertex | closed walk | 100%
|
| if every vertex is connected to every other vertex | connected graph | 100%
|
| A trail that travels every edge only once and starts and finishes at the same vertex; vertices can be repeated | eulerian circuit | 100%
|
| A cycle that visits every vertex in the graph only once | hamitlonian cycle | 100%
|
| A path starting and finishing at different vertexes | open path | 100%
|
| A walk not ending and starting at the same vertex | open walk | 100%
|
| A walk with no repeated edges and vertices | path | 100%
|
| A graph that can be drawn without its edges crossing over | planar graph | 100%
|
| A trail that travels every edge once and starts and finishes at different vertexes; vertices can be repeated | semi-eulerian trail | 100%
|
| An open path that visits every vertex in the graph only once | semi-hamiltonian | 100%
|
| An undirected and unweighted graph with no loops and no multiple edges | simple graph | 100%
|
| A selection of edges and vertices from an original graph | subgraph | 100%
|
| A walk that involves no repeated edges | trail | 100%
|
| A connected simple graph that contains no cycles | tree | 100%
|
| Euler's rule | v+f=e+2 | 100%
|
| A sequence of verticies in which there is an edge from each vertex to the next; may include repeated edges and verticies | walk | 100%
|