Goodall, A. J.; de Mier, A.; Noble, S. D.; Noy, M. The Tutte polynomial characterizes simple outerplanar graphs. (English) Zbl 1223.05126 Comb. Probab. Comput. 20, No. 4, 609-616 (2011). MSC: 05C31 PDFBibTeX XMLCite \textit{A. J. Goodall} et al., Comb. Probab. Comput. 20, No. 4, 609--616 (2011; Zbl 1223.05126) Full Text: DOI
Merino, Criel; Noble, Steven D. The equivalence of two graph polynomials and a symmetric function. (English) Zbl 1194.05060 Comb. Probab. Comput. 18, No. 4, 601-615 (2009). MSC: 05C31 05E05 13F55 PDFBibTeX XMLCite \textit{C. Merino} and \textit{S. D. Noble}, Comb. Probab. Comput. 18, No. 4, 601--615 (2009; Zbl 1194.05060) Full Text: DOI arXiv
Noble, S. D. Evaluating the rank generating function of a graphic 2-polymatroid. (English) Zbl 1093.05014 Comb. Probab. Comput. 15, No. 3, 449-461 (2006). MSC: 05B35 PDFBibTeX XMLCite \textit{S. D. Noble}, Comb. Probab. Comput. 15, No. 3, 449--461 (2006; Zbl 1093.05014) Full Text: DOI
Noble, S. D. Evaluating the Tutte polynomial for graphs of bounded tree-width. (English) Zbl 0917.05072 Comb. Probab. Comput. 7, No. 3, 307-321 (1998). MSC: 05C85 68R10 PDFBibTeX XMLCite \textit{S. D. Noble}, Comb. Probab. Comput. 7, No. 3, 307--321 (1998; Zbl 0917.05072) Full Text: DOI