discipline of graph theory, a graph labeling is the assignment of labels, traditionally represented by integers, to edges and/or vertices of a graph. Formally...

theorem Girth Graph drawing Graph homomorphism Graph labeling Graceful labeling Graph partition Graph pebbling Graph property Graph reduction Graph-structured...

application of graph theory, where subsets of connected components are uniquely labeled based on a given heuristic. Connected-component labeling is not to...

A graph which admits a graceful labeling is called a graceful graph. The name "graceful labeling" is due to Solomon W. Golomb; this type of labeling was...

graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject...

or edges have labels. The terms vertex-labeled or edge-labeled may be used to specify which objects of a graph have labels. Graph labeling refers to several...

vertices and the same arc label (note that this notion of a labeled graph is different from the notion given by the article graph labeling). Multidimensional...

In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected...

classification algorithm produces a canonical labeling of a graph chosen uniformly at random from the set of all n-vertex graphs after only two refinement steps. Small...

on the vertex labeling, its spectrum is a graph invariant, although not a complete one. Spectral graph theory is also concerned with graph parameters that...