Hamiltonian Path
A loop through a Graph that visits each node exactly once but does not end adjacentto the initial point. The number of Hamiltonian paths on an 
-A006070,Gardner 1986, pp. 23-24).
References
Gardner, M. ``The Binary Gray Code.'' In Knotted Doughnuts and Other Mathematical Entertainments. New York: W. H. Freeman, pp. 23-24, 1986. Sloane, N. J. A. SequenceA006070/M5295in ``An On-Line Version of the Encyclopedia of Integer Sequences.''http://www.research.att.com/~njas/sequences/eisonline.html and Sloane, N. J. A. and Plouffe, S.The Encyclopedia of Integer Sequences. San Diego: Academic Press, 1995.
- Percolation Theory
- Percolation Threshold
- Perfect Box
- Perfect Cubic
- Perfect Cuboid
- Perfect Difference Set
- Perfect Digital Invariant
- Perfect Information
- Perfect Magic Cube
- Perfect Number
- Perfect Partition
- Perfect Proportion
- Perfect Rectangle
- Perfect Ruler
- Perfect Set
- Perfect Square
- Perfect Square Dissection
- Periapsis
- Perigon
- Perimeter
- Perimeter Polynomial
- Period Doubling
- Periodic Function
- Periodic Point
- Periodic Sequence