It has an edge from every vertex to every other vertex

It is fully colored

It contains no edges

It only has vertices and no edges

A graph with only one vertex

A graph that is not connected

A graph with vertices but no edges

A graph with no vertices and no edges

The maximum degree of the graph

The number of vertices in the graph

The number of edges in the graph

The sequence of vertices

A graph where each edge has a direction

A graph where edges are bidirectional

A graph with no directions on edges

A graph that can only be drawn straight

Two graphs having the same structure

Graphs that are colored the same

Graphs that are completely different

Graphs that have identical vertices

A directed graph with one way edges

An undirected graph with no cycles

A complete graph

A graph with only one vertex

A path that starts and ends at the same vertex

A path that can be traversed in both directions

A path that visits every vertex once

A path that crosses every edge exactly once

Calculated the shortest path across all bridges

Designed new bridges to make the path possible

Found a path that crossed each bridge twice

Proved that a path crossing each bridge once is impossible unless each vertex has an even degree

A path that includes at least one cycle

A path that uses the shortest possible route

A path that crosses each edge exactly once

A path that visits each vertex exactly once

A graph that can be colored using two colors such that no two adjacent vertices share the same color

A graph where each vertex is connected to all other vertices

A graph with vertices of only two types

A graph that contains exactly two vertices

A graph where edges have directions

A graph where each edge has a numerical value associated with it

A graph that is heavier than usual

A graph used in weightlifting competitions

The number of edges connected to the vertex

The maximum distance to another vertex

The number of graphs it belongs to

The direction of edges connected to the vertex