49 citations · 76 across the 19 of their papers we have counts for
Showing 2012 · math.COShow all
2 papers · 2 filters
math.CO2012★ 49 cited
Resolving sets for Johnson and Kneser graphs
Robert F. Bailey, José Cáceres, Delia Garijo +4
A set of vertices in a graph is a {\em resolving set} for if, for any two vertices , there exists such that the distances . In this pa…
math.CO2012★ 1 cited
A note on packing spanning trees in graphs and bases in matroids
Robert F. Bailey, Mike Newman, Brett Stevens
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where th…