uniquely colorable graph
graph with only one possible coloring with minimal number of colors
edgeless graph
graph without edges (on any number of vertices)
half graph
type of graph in mathematics
Apollonian network
graph formed by subdivision of triangle faces
hypercube graph
graphs formed by a hypercube's edges and vertices
tree
undirected, connected and acyclic graph
complete bipartite graph
every vertex of first set attached to every vertex of second set
ladder graph
planar undirected graph with 2n vertices and 3n-2 edges; the Cartesian product of two path graphs, one of which has only one edge
complete graph
simple undirected graph in which every pair of distinct vertices is connected by a unique edge