Search Results for ""

A planar hypotraceable graph is a hypotraceable graph that is also planar. A number of planar hypotraceable graphs are illustrated above. Using a theorem of Thomassen (1974), ...

A plane curve is a curve that lies in a single plane. A plane curve may be closed or open. Curves which are interesting for some reason and whose properties have therefore ...

The word "pole" is used prominently in a number of very different branches of mathematics. Perhaps the most important and widespread usage is to denote a singularity of a ...

If an n-sided Poncelet transverse constructed for two given conic sections is closed for one point of origin, it is closed for any position of the point of origin. ...

The Poussin graph is the 15-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

A projective module generalizes the concept of the free module. A module M over a nonzero unit ring R is projective iff it is a direct summand of a free module, i.e., of some ...

A graph with projective plane crossing number equal to 0 may be said to be projective planar. Examples of projective planar graphs with graph crossing number >=2 include the ...

The set R union {infty}, obtained by adjoining one improper element to the set R of real numbers, is the set of projectively extended real numbers. Although notation is not ...

A notion introduced by R. M. Wilson in 1974. Given a finite graph G with n vertices, puz(G) is defined as the graph whose nodes are the labelings of G leaving one node ...

A pyramid is a polyhedron with one face (known as the "base") a polygon and all the other faces triangles meeting at a common polygon vertex (known as the "apex"). A right ...