Search Results for ""

A tree having four branches at each node. Quadtrees are used in the construction of some multidimensional databases (e.g., cartography, computer graphics, and image ...

A d-dimensional framework is a pair (G,p) where G=(V,E) is a graph with vertex set V and edge set E and p:V->R^d is a map that assigns a point in R^d to each vertex of G. The ...

The Hadwiger conjecture is a generalization of the four-color theorem which states that for any loopless graph G with h(G) the Hadwiger number and chi(G) the chromatic ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

A domatic partition is a partition of the vertices of a graph into disjoint dominating sets. The maximum number of disjoint dominating sets in a domatic partition of a graph ...

An embedding is a representation of a topological object, manifold, graph, field, etc. in a certain space in such a way that its connectivity or algebraic properties are ...

If A, B, and C are three points on one line, D, E, and F are three points on another line, and AE meets BD at X, AF meets CD at Y, and BF meets CE at Z, then the three points ...

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...

A tree (also called a bicentral tree) having two nodes that are graph centers. The numbers of bicentered trees on n=1, 2, ... nodes are 0, 1, 0, 1, 1, 3, 4, 11, 20, 51, 108 ...

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together contain every edge exactly twice. This conjecture remains open, ...