Search Results for ""

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, ...

An incircle is an inscribed circle of a polygon, i.e., a circle that is tangent to each of the polygon's sides. The center I of the incircle is called the incenter, and the ...

A line is a straight one-dimensional figure having no thickness and extending infinitely in both directions. A line is sometimes called a straight line or, more archaically, ...

Three circles packed inside a triangle such that each is tangent to the other two and to two sides of the triangle are known as Malfatti circles. The Malfatti configuration ...

A manifold is a topological space that is locally Euclidean (i.e., around every point, there is a neighborhood that is topologically the same as the open unit ball in R^n). ...

Orthogonal polynomials are classes of polynomials {p_n(x)} defined over a range [a,b] that obey an orthogonality relation int_a^bw(x)p_m(x)p_n(x)dx=delta_(mn)c_n, (1) where ...

Starting with the circle P_1 tangent to the three semicircles forming the arbelos, construct a chain of tangent circles P_i, all tangent to one of the two small interior ...

A planar hypohamiltonian graph is a hypohamiltonian graph that is also planar. A number of planar hypohamiltonian graphs are illustrated above. Chvátal (1973) first asked if ...

Two integers are relatively prime if they share no common positive factors (divisors) except 1. Using the notation (m,n) to denote the greatest common divisor, two integers m ...

The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...