This is a replacement paper. There are 6 chapters. The first two chapters are introductory. The third chapter is on extremal graph theory. The fourth chapter is about algebra in graph theory. The fifth chapter is focused on algorithms. The third section of the fifth chapter deals with computable time. The sixth chapter has sections on probability and enumeration.

Comment: The algorithm in Section 5.3 does not appear to follow the Turing model. There were other unrelated errors. Theorem 29 was not stated properly. There should have been a reference attached to Theorem 31. The explanation and definition of degree for Section 2.2 should have been done more carefully. It is not clear if this list of errors is comprehensive