Publications

Here is a list of my publications with links to electronic versions where available. Clicking BURA takes you to the version of the paper on the Brunel University Research Archive. Please e-mail if you would like a reprint.

• Goodall, A.J., de Mier, A., Noble, S.D., Noy, M. The Tutte polynomial characterizes simple outerplanar graphs. Electronic Notes In Discrete Mathematics 38 (2011) 639-644.
• Lin, Y., Noble, S.D., Jin, X., Cheng, W. On plane graphs with link component number equal to the nullity. To appear in Discrete Applied Mathematics.
• Merino, C., Noble, S.D., Ramírez-Ibañez, M., Villarroel, R. On the structure of the h-vector of a paving matroid. Submitted. ArXiv.
• Goodall, A.J., de Mier, A., Noble, S.D., Noy, M. The Tutte polynomial characterizes simple outerplanar graphs. Combinatorics, Probability and Computing 20 (2011) 609-616. Electronic version copyright CUP.
• Noble, S.D., Hansen, P., Mladenović, N. Maximizing edge-ratio is NP-complete. Discrete Applied Mathematics 159 (2011) 2276-2280. Preprint.
• Chavez-Lomelí, L.E., Merino, C., Noble, S.D., Ramírez-Ibañez, M. Some inequalities for the Tutte polynomial. European Journal of Combinatorics 32 (2011) 422-433. ArXiv.
• Eggemann, N., Noble, S.D. The complexity of two graph orientation problems. Discrete Applied Mathematics 160 (2012) 513-517. ArXiv.
• Eggemann, N., Noble, S.D. Minimizing the oriented diameter of a planar graph. Electronic Notes in Discrete Mathematics  34 (2009) 267-271. BURA.
• Eggemann, N., Havet, F., Noble, S.D. k-L(2,1)-Labelling for Planar Graphs is NP-complete for k >= 4. Discrete Applied Mathematics 158 (2010) 1777-1778. ArXiv
• Goodall, A.J., Noble, S.D. Counting cocircuits and convex two-colourings is #P-complete. Preprint. ArXiv
• Merino, C., Noble, S.D. The equivalence of two graph polynomials and a symmetric function. Combinatorics Probability and Computing  18 (2009) 601-615. Electronic version copyright CUP
• Eggemann, N., Noble, S.D. The clustering coefficient of a scale-free random graph. Discrete Applied Mathematics 159 (2011) 953-965. ArXiv
• Noble, S.D. Evaluating a weighted graph polynomial for graphs of bounded tree-width. The Electronic Journal of Combinatorics  16(1) (2009) R64. EJC Volume 16
• Noble, S.D. The complexity of graph polynomials. Chapter in Combinatorics, Complexity and Chance: A Tribute to Dominic Welsh. Ed Geoffrey Grimmett and Colin McDiarmid OUP 2007.
• Noble, S.D. Evaluating the rank generating function of a graphic 2-polymatroid. Combinatorics Probability and Computing  15 (2006) 449-461. BURA
• Krasikov, I., Noble, S.D. Finding next-to-shortest paths in a graph. Information Processing Letters   92 (2004) 117-119. BURA
• Koller, A.E., Noble, S.D. The domination number of greedy heuristics for the frequency assignment problem. Discrete Mathematics  275 (2004) 331-338. BURA
• Leese, R.A., Noble, S.D. Cyclic labelling with constraints at two distances. The Electronic Journal of Combinatorics  11 (2004) R10. EJC Volume 11
• Calkin, N., Merino, C., Noble, S.D., Noy, M. Improved bounds for the number of forests and acyclic orientations in the square lattice. The Electronic Journal of Combinatorics  10 (2003) R4. EJC Volume 10
• Luczak, M.J., Noble, S.D. Optimal arrangement of data in a tree directory. Discrete Applied Mathematics  121 (2002) 307-315. BURA
• Noble, S.D., Welsh, D.J.A. Knot graphs. Journal of Graph Theory  34 (2000) 100-111. BURA
• Noble, S.D., Welsh, D.J.A. A weighted graph polynomial from chromatic invariants of knots. Annales de l'Institute Fouier 49 (1999) 1057-1087.
• Noble, S.D. Evaluating the Tutte polynomial for graphs of bounded tree-width. Combinatorics Probability and Computing  7 (1998) 307-323. BURA
• Noble, S.D. Recognising a partitionable simplicial complex is in NP. Discrete Mathematics  152 (1996) 303-305. BURA