Graph of a function | graph | Bipartite graph | planar graph | graph theory | directed graph | Under Graph | random graph | Planar graph | Graph traversal | Graph theory | Graph (mathematics) | Gabriel graph | visibility graph | Unit distance graph | rook's graph | Rado graph | minor (graph theory) | Lattice graph | interval graph | Graph-tool | Graph (data structure) | Graph coloring | graph coloring | Graph | Factor graph | Exponential random graph models | Duflo isomorphism | Directed graph | Directed acyclic graph |
For instance, the triangulations of regular polygons (with size given by the number of sides of the polygon, and a fixed choice of polygon to triangulate for each size) and the set of unrooted binary plane trees (up to graph isomorphism, with a fixed ordering of the leaves, and with size given by the number of leaves) are both counted by the Catalan numbers, so they form isomorphic combinatorial classes.