graph theory

graph

vertex, edge

omega-graph, hypergraph

quiver, n-quiver

category of simple graphs

reflexive, directed

bipartite

planar

reflexivedirected graph + unital associative composition = category

ribbon graph, combinatorial map, topological map, child's drawing

vertex coloring, clique

A graph is finite if both its set of vertices as well as its set of edges are finite sets.

finite set

finite category

See also

Created on January 18, 2018 at 12:04:41. See the history of this page for a list of all contributions to it.