Hamilton cycle embeddings of complete tripartite graphs and their applications
A central problem in topological graph theory is determining the (orientable or nonorientable) genus of a given graph <i>G</i>. For a general graph <i>G</i>, this problem is very difficult (in fact, it is NP-complete). Thus, it is desirable to have large families of graphs fo...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
VANDERBILT
2012
|
| Subjects: | |
| Online Access: | http://etd.library.vanderbilt.edu/available/etd-03202012-170814/ |