Color Trades on Graphs
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Hoffman, Dean | |
| dc.contributor.author | Carr, John | |
| dc.date.accessioned | 2022-08-03T14:26:24Z | |
| dc.date.available | 2022-08-03T14:26:24Z | |
| dc.date.issued | 2022-08-03 | |
| dc.identifier.uri | https://etd.auburn.edu//handle/10415/8398 | |
| dc.description.abstract | Edge-colorings of graphs have a rich history and are widely studied. Trade spectra of graphs are relatively new and ripe for study. The color-trade-spectrum of a graph G is defined to be the set of all t for which there exist two proper edge-colorings of G using t colors such that each vertex of G is incident to the same set of colors under each edge-coloring while each edge receives a different color under each edge-coloring. We show some general results and present various constructions which are used to determine the color-trade-spectrum of several families of graphs. | en_US |
| dc.subject | Mathematics and Statistics | en_US |
| dc.title | Color Trades on Graphs | en_US |
| dc.type | PhD Dissertation | en_US |
| dc.embargo.status | NOT_EMBARGOED | en_US |
| dc.embargo.enddate | 2022-08-03 | en_US |