The complexity of graph polynomials
<p>This thesis examines graph polynomials and particularly their complexity. We give short proofs of two results from Gessel and Sagan (1996) which present new evaluations of the Tutte polynomial concerning orientations. A theorem of Massey et al (1997) gives an expression concerning the avera...
| Main Authors: | , |
|---|---|
| מחברים אחרים: | |
| פורמט: | Thesis |
| שפה: | English |
| יצא לאור: |
1997
|
| נושאים: |