Bounding the Number of Graphs Containing Very Long Induced Paths
Induced graphs are used to describe the structure of a graph, one such type of induced graph that has been studied are long paths. In this thesis we show a way to represent such graphs in terms of an array with two colors and a labeled graph. Using this representation and the techniques of Polya c...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
BYU ScholarsArchive
2003
|
| Subjects: | |
| Online Access: | https://scholarsarchive.byu.edu/etd/31 https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1030&context=etd |