An assignment of symbols or other meanings to a set of bitstrings. Binary Search Tree A binary tree that has been labelled with numbers so that the right offspring and all of its descendants have labels smaller than the label of the vertex, and the left offspring and all its descendants have labels larger than that of the vertex. . Also known as a cut-edge . The chromatic number of a graph is the smallest k for which the graph is k-colorable . A subgraph that is a complete graph.
Several results concerning the existence of hamiltonian circuits refer to the closure of a graph.
A complete graph is a simple graph in which all pairs of vertices are adjacent . They are denoted by K n , where n is the number of vertices. The corresponding concept for digraphs is called a complete symmetric digraph, in which every ordered pair of vertices are joined by an arc. Maximal means that there is no larger connected, induced subgraph containing the vertices of the component. Given a graph G, if two vertices of G are identified and any loops or multiple edges created by this identification removed, the resulting graph is called the condensed graph .