| A weighted graph polynomial from chromatic invariants of knots SD Noble, DJA Welsh Annales de l'institut Fourier 49 (3), 1057-1087, 1999 | 127 | 1999 |
| Evaluating the Tutte polynomial for graphs of bounded tree-width SD Noble Combinatorics, Probability & Computing 7 (3), 307-321, 1998 | 87 | 1998 |
| The clustering coefficient of a scale-free random graph N Eggemann, SD Noble Discrete Applied Mathematics 159 (10), 953-965, 2011 | 55 | 2011 |
| On the structure of the h-vector of a paving matroid C Merino, SD Noble, M Ramírez-Ibáńez, R Villarroel-Flores European Journal of Combinatorics 33 (8), 1787-1799, 2012 | 36 | 2012 |
| Improved bounds for the number of forests and acyclic orientations in the square lattice N Calkin, C Merino, S Noble, M Noy the electronic journal of combinatorics 10 (1), R4, 2003 | 35 | 2003 |
| Matroids, Delta-matroids and Embedded Graphs C Chun, I Moffatt, SD Noble, R Rueckriemen arXiv preprint arXiv:1403.0920, 2014 | 31 | 2014 |
| Knot graphs SD Noble, DJA Welsh Journal of Graph Theory 34 (1), 2000 | 29 | 2000 |
| Domination analysis of greedy heuristics for the frequency assignment problem AE Koller, SD Noble Discrete Mathematics 275 (1-3), 331-338, 2004 | 27 | 2004 |
| On the interplay between embedded graphs and delta‐matroids C Chun, I Moffatt, SD Noble, R Rueckriemen Proceedings of the London Mathematical Society 118 (3), 675-700, 2019 | 26 | 2019 |
| Cyclic labellings with constraints at two distances RA Leese, SD Noble the electronic journal of combinatorics 11 (1), 16, 2004 | 26 | 2004 |
| Finding next-to-shortest paths in a graph I Krasikov, SD Noble Information processing letters 92 (3), 117-119, 2004 | 25 | 2004 |
| The sequencing of aircraft departures A Craig, R Ketzscer, RA Leese, SD Noble, K Parrott, J Preater, RE Wilson, ... 40th European study group with industry, Keele, 2001 | 21* | 2001 |
| The equivalence of two graph polynomials and a symmetric function C Merino, SD Noble Combinatorics, Probability & Computing 18 (4), 601-615, 2009 | 17 | 2009 |
| kL (2, 1)-labelling for planar graphs is NP-complete for k≥ 4 N Eggemann, F Havet, SD Noble Discrete Applied Mathematics 158 (16), 1777-1788, 2010 | 16 | 2010 |
| Matroids, delta-matroids and embedded graphs C Chun, I Moffatt, SD Noble, R Rueckriemen Journal of Combinatorial Theory, Series A 167, 7-59, 2019 | 15 | 2019 |
| Minimizing the oriented diameter of a planar graph N Eggemann, SD Noble Electronic Notes in Discrete Mathematics 34, 267-271, 2009 | 14 | 2009 |
| Evaluating a weighted graph polynomial for graphs of bounded tree-width SD Noble the electronic journal of combinatorics 16 (1), 64, 2009 | 14 | 2009 |
| The Merino–Welsh conjecture holds for series–parallel graphs SD Noble, GF Royle European Journal of Combinatorics 38, 24-35, 2014 | 13 | 2014 |
| Some inequalities for the Tutte polynomial LE Chávez-Lomelí, C Merino, SD Noble, M Ramírez-Ibáńez European Journal of Combinatorics 32 (3), 422-433, 2011 | 13 | 2011 |
| Optimal arrangement of data in a tree directory:[Discrete Appl. Math 113 (2001) 243–253] MJ Luczak, SD Noble Discrete applied mathematics 121 (1), 307-315, 2002 | 9* | 2002 |
Criel MerinoUniversidad Nacional Autónoma de MéxicoEmail verificata su matem.unam.mx
