2 citations to 10.1016/j.ejc.2009.11.021 (Crossref Cited-By Service)
  1. Tibor Jordán, Viktória E. Kaszanitzky, “Highly connected rigidity matroids have unique underlying graphs”, European Journal of Combinatorics, 34, № 2, 2013, 240  crossref
  2. Dániel Garamvölgyi, Tibor Jordán, Csaba Király, “Count and cofactor matroids of highly connected graphs”, Journal of Combinatorial Theory, Series B, 166, 2024, 1  crossref