Some of the material in is restricted to members of the community. By logging in, you may be able to gain additional access to certain collections or items. If you have questions about access or logging in, please use the form on the Contact Page.
The main result in this thesis bounds the combinatorial modulus of a ring in a triangulation graph in terms of the modulus of a related ring. The bounds depend only on how the rings are related and not on the rings themselves. This may be used to solve the combinatorial type problem in a variety of situation, most significant in graphs with unbounded degree. Other results regarding the type problem are presented along with several examples illustrating the limits of the results.
