We discuss two papers of Jarník from 1930 to 1934 which are devoted to the Minimal Spanning Tree Problem and the Eucleidian Steiner Tree Problem. These papers are historical milestiones in combinatorial optimization.