Show Summary Details

Indexlocked

  • Published in print: 28 April 2016
  • Published online: 28 April 2016

A

  • addition rule19
  • affine plane133–8
  • agriculture114–15, 126
  • al-Antāki110–11
  • algorithm
    • efficient24
    • exponential-time25
    • greedy92
    • polynomial-time25
  • alkane16, 91
  • al-Karajī41
  • al-Khwārizmī14
  • antiprism82
  • Appel, K.107
  • Archimedean polyhedra82
  • arrangement31–3

B

  • Bachet de Méziriac117–18
  • balanced block design (BIBD)126
  • Bernoulli, J.140
  • Bhaskarachārya31
  • binary word21
  • binomial theorem44–5
  • birthday paradox1, 34
  • block design124–6
  • Bose, R. C. et al.121
  • box principle50
  • buckyball84
  • Burnside’s lemma71

C

D

  • De Morgan, A.13, 146
  • degree of vertex88
  • derangement problem1, 55–8
  • design
  • Dirac, G.96
  • Dirichlet, L.51
  • disjoint subsets19
  • distinct partition146
  • distribution45–6
  • dividing a circle105
  • division rule22
  • dodecahedron79–80
  • dominoes9
  • dual graph103–4
  • Dürer, A.109

E

  • edge of graph86
  • edge of polyhedron79
  • efficiency of algorithm24–6
  • Emperor Yu109
  • enumeration problem7, 15–22
  • enumerator67–8, 142–4
  • equireplicate design125
  • Erdős, Paul6, 90
  • Euclid79
  • Euler, L.11, 79, 88, 120–1, 141
  • Euler’s formula for plane graphs102
  • Euler’s 36 officers problem120–1, 138
  • Euler’s pentagonal number formula144–5
  • Euler’s polyhedron formula80, 102
  • Eulerian graph93–4
  • existence problem7–13
  • exponential-time algorithm25
  • extended box principle51

F

  • face of plane graph102
  • face of polyhedron80
  • factorial31
  • family tree90
  • Fano plane129
  • Felgenhauer B. and Jarvis, F.116
  • Fibonacci number62–3
  • finite projective plane129–5, 138–9
  • Fisher, R. A.114, 126
  • Fisher’s inequality126
  • four-colour problem13, 106–7
  • four-colour theorem108
  • Franklin, B.112–13
  • Frobenius, G.71
  • fullerene84

G

  • Gas–Water–Electricity problem12, 99–100
  • generating function141–3
  • generator66
  • geodesic dome84
  • graph
    • complete87
    • complete bipartite87
    • connected87
    • cycle87
    • dual103–4
    • Eulerian93
    • Hamiltonian96
    • planar100
    • plane100
    • simple86
  • greedy algorithm92

H

  • Haken, W.107
  • Hall, Philip64
  • Hall’s theorem65, 117
  • Hamilton, W. R.13, 95
  • Hamiltonian cycle96
  • Hamiltonian graph96–8
  • handshaking lemma88
  • Hardy, G. H.147, 149–50
  • Hemachandra61, 62
  • hexagonal tiling75

I

  • I Ching29
  • icosahedron79–80
  • Icosian game95
  • induction proof65
  • inclusion–exclusion principle52–5
  • incomplete block125
  • infinite face102
  • input size24, 25
  • irregular tiling78–9

J

K

L

M

N

  • Naudé, P.143–4
  • n-omino17
  • non-deterministic polynomial-time problem25
  • normalized latin square114
  • NP25–7
  • NP-complete problem27
  • nucleotide30
  • number theory20, 54

O

P

R

S

  • Saadia Gaon32
  • Śambhu31
  • satisfiability problem26
  • schoolgirls problem128–9
  • Scrabble67–8
  • semi-magic square110
  • semi-regular polyhedron82–4
  • semi-regular tiling75–7
  • simple graph86
  • six-colour theorem107
  • Snow White16
  • soccer ball84
  • square tiling73
  • Steiner triple system127
  • Stirling’s formula33
  • subtraction rule19
  • sudoku1, 114–16
  • Suśruta35
  • Sylvester, J. J.129, 147
  • symbolic generator66–7
  • symmetric design126

T

U

V

  • Varāhamihira36
  • Venn diagram52
  • vertex of graph86
  • vertex of polyhedron79
  • Voyage Round the World95

W

Y

Z

  • Zhu Shijie41