In this paper we proved that 133—cubic graph can be divided into two classes. The first class is graph B

the second class is given recursively by following theorem. Theorem: (Ⅰ) The 133—cubic graph G containing only one 1—elementary path is graph A. (Ⅱ) The 133—cubic graph G containiing k+1 (k≥1) 1—elrmetary pathes can be obtained in following ways: (1) In a 133—cubic graph G (G≠B) containing k (k≧1) 1—elementary pathes

two 3—elementary pathes can be departed into four 3—elementary pnthes. Then let them identify with the four 3—elementary pathes of a fundmental graph of type H respectively. (2) In a 133—cubic graph G (G≠B) containing k (k≧1) 1—elementary pathes

one 3—elementary path can be departed into two 3—elementry pathes. Then

Let them identify with the two 3—elementary pathes of a fundmental graph of type π respectively