Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Omar Hanatleh
Tidjani Négadi
Jhonathan Pinzon
Liangliang Shang
Giovanni Venturelli
Chen Ma
Jing-Sheng Wong
Anne L. Martel
Radu Timofte
Gokulraj Prabhakaran
Home
/
Author
/
S. D. NOBLE
Author Info
Open Visualization
Name
Affiliation
Papers
S. D. NOBLE
Department of Mathematical Sciences, Brunel University, Kingston Lane, Uxbridge UB8 3PH, United Kingdom
16
Collaborators
Citations
PageRank
21
83
9.56
Referers
Referees
References
164
132
116
Search Limit
100
164
Publications (16 rows)
Collaborators (21 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
The excluded 3-minors for vf-safe delta-matroids
0
0.34
2021
The e-exchange basis graph and matroid connectedness.
0
0.34
2019
How many delta-matroids are there?
0
0.34
2018
On zeros of the characteristic polynomial of matroids of bounded tree-width.
0
0.34
2017
Inductive tools for connected delta-matroids and multimatroids.
0
0.34
2017
On the complexity of generalized chromatic polynomials.
0
0.34
2017
On plane graphs with link component number equal to the nullity
1
0.41
2012
The tutte polynomial characterizes simple outerplanar graphs
0
0.34
2011
The clustering coefficient of a scale-free random graph
11
0.90
2011
Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width
5
0.49
2009
Evaluating the Rank Generating Function of a Graphic 2-Polymatroid
0
0.34
2006
Finding next-to-shortest paths in a graph
9
0.88
2004
Cyclic Labellings with Constraints at Two Distances
14
0.90
2004
Knot graphs
3
0.67
2000
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
38
1.88
1998
Recognising a partitionable simplicial complex is in NP
2
0.73
1996
1