Search Results for ""

A graph G is a hypotraceable graph if G has no Hamiltonian path (i.e., it is not a traceable graph), but G-v has a Hamiltonian path (i.e., is a traceable graph) for every v ...

"The" I graph is the path graph on two vertices: P_2. An I-graph I(n,j,k) for 1<=j,k<n and j,k!=n/2 is a generalization of a generalized Petersen graph and has vertex set ...

Keller conjectured that tiling an n-dimensional space with n-dimensional hypercubes of equal size yields an arrangement in which at least two hypercubes have an entire ...

The Klein bottle crossing number of a graph G is the minimum number of crossings possible when embedding G on a Klein bottle (cf. Garnder 1986, pp. 137-138). While the ...

A lattice reduction algorithm, named after discoverers Lenstra, Lenstra, and Lovasz (1982), that produces a lattice basis of "short" vectors. It was noticed by Lenstra et al. ...

The process of finding a reduced set of basis vectors for a given lattice having certain special properties. Lattice reduction algorithms are used in a number of modern ...

A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...

An ordered factorization is a factorization (not necessarily into prime factors) in which a×b is considered distinct from b×a. The following table lists the ordered ...

Given an arrangement of points, a line containing just two of them is called an ordinary line. Dirac (1951) conjectured that every sufficiently set of n noncollinear points ...

An Ore graph is a graph that satisfies Ore's theorem, i.e., a graph G for which the sums of the degrees of nonadjacent vertices is greater than or equal to the number of ...