  A proof of Sharkovsky's Theorem is given. It is shown how this proof
naturally generalizes to looking at maps on graphs and to Sharkovsky-type
theorems for these maps. The paper is written at an elementary level and is
meant as an introduction to one-dimensional combinatorial dynamics.
