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...
| 主要な著者: | , |
|---|---|
| その他の著者: | |
| フォーマット: | 学位論文 |
| 言語: | English |
| 出版事項: |
1997
|
| 主題: |