1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.CO2015
Global cycle properties in graphs with large minimum clustering coefficient
Adam Borchert, Skylar Nicol, Ortrud R. Oellermann
The clustering coefficient of a vertex in a graph is the proportion of neighbours of the vertex that are adjacent. The minimum clustering coefficient of a graph is the smallest clu…
math.CO2015★ 1 cited
Global cycle properties in locally isometric graphs
Adam Borchert, Skylar Nicol, Ortrud R. Oellermann
A graph G is locally isometric if the subgraph induced by the neighbourhood of every vertex is an isometric subgraph of G. It is shown that the hamilton cycle problem for locally i…