| year = 2005}}..</ref> although the reverse is not true.
*The vertices of the [[Kneser graph]] {{math|''KG''(''n'',''k'')}} are the {{mvar|k}}-subsets of an {{mvar|n}}-set, and the edges are between [[Disjoint sets|disjoint]] sets. The complement is the [[Johnson graph]] {{math|''J''(''n'',''k'')}}, where the edges are between intersecting sets.<ref>{{citation
| last1 = Bailey | first1 = Robert F.
| last2 = Cáceres | first2 = José
| last3 = Garijo | first3 = Delia
| last4 = González | first4 = Antonio
| last5 = Márquez | first5 = Alberto
| last6 = Meagher | first6 = Karen
| last7 = Puertas | first7 = María Luz
| doi = 10.1016/j.ejc.2012.10.008
| issue = 4
| journal = [[European Journal of Combinatorics]]
| mr = 3010114
| pages = 736–751
| title = Resolving sets for Johnson and Kneser graphs
