Search Results for ""

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

The mid-arc triangle is the triangle DeltaA^'B^'C^' whose vertices consist of the intersections of the internal angle bisectors with the incircle, where the points of ...

The midcircle of two given circles is the circle which would invert the circles into each other. Dixon (1991) gives constructions for the midcircle for four of the five ...

Is it possible to cover completely the surface of a sphere with congruent, nonoverlapping arcs of great circles? Conway and Croft (1964) proved that it can be covered with ...

An inequality which implies the correctness of the Robertson conjecture (Milin 1964). de Branges (1985) proved this conjecture, which led to the proof of the full Bieberbach ...

A map projection given by the following transformation, x = lambda-lambda_0 (1) y = 5/4ln[tan(1/4pi+2/5phi)] (2) = 5/4sinh^(-1)[tan(4/5phi)]. (3) Here, x and y are the plane ...

Several cylindrical equidistant projections were devised by R. Miller. Miller's projections have standard parallels of phi_1=37 degrees30^' (giving minimal overall scale ...

If a number fails Miller's primality test for some base a, it is not a prime. If the number passes, it may be a prime. A composite number passing Miller's test is called a ...

In French and German usage, one milliard equals 10^9=1000000000. American usage does not have a number called the milliard, instead using the term billion to denote 10^9. ...

det(i+j+mu; 2i-j)_(i,j=0)^(n-1)=2^(-n)product_(k=0)^(n-1)Delta_(2k)(2mu), where mu is an indeterminate, Delta_0(mu)=2, ...