Search Results for ""

The term "lobster" is used to refer either to a particular polyiamond or to a class of tree called a lobster graph. When referring to polyiamonds, the lobster is the ...

An expanded paper bag, cushion, or pillow has a distinctive shape. Given the dimensions of a flat rectangular bag with dimensions a, b, bounds for the maximum volume of ...

A q-analog of Zeilberger's algorithm.

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

A connected bipartite graph is called Hamilton-laceable, a term apparently introduced in Simmons (1978), if it has a u-v Hamiltonian path for all pairs of vertices u and v, ...

The star graph S_n of order n, sometimes simply known as an "n-star" (Harary 1994, pp. 17-18; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 23), is a tree on n nodes with ...

Sylvester's line problem, known as the Sylvester-Gallai theorem in proved form, states that it is not possible to arrange a finite number of points so that a line through ...

A uniquely k-colorable graph G is a chi-colorable graph such that every chi-coloring gives the same partition of G (Chao 2001). Examples of uniquely minimal colorable classes ...

An alkane graph is a tree in which vertices correspond to atoms and edges to carbon-carbon or hydrogen-carbon bonds in a chemical alkane. In chemistry, an alkane is an ...

Given an expression involving known constants, integration in finite terms, computation of limits, etc., the constant problem is the determination of if the expression is ...