Combinatorial Type Problems for Triangulation Graphs
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...
Other Authors: | Wood, William E. (authoraut) |
---|---|
Format: | Others |
Language: | English English |
Published: |
Florida State University
|
Subjects: | |
Online Access: | http://purl.flvc.org/fsu/fd/FSU_migr_etd-0794 |
Similar Items
-
Hamiltonian cycles in maximal planar graphs and planar triangulations
by: Mofokeng, Tshenolo
Published: (2017) -
Combinatorial Games on Graphs
by: Williams, Trevor K.
Published: (2017) -
External combinatories of graphs and sets of integers
by: Jin, Guoping
Published: (1993) -
Combinatorial incremental problems
by: Unda Surawski, Francisco T.
Published: (2019) -
Some topics in combinatorial design theory and algebraic graph theory /
by: Fiala, Nick C.
Published: (2002)