{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T21:22:32Z","timestamp":1773436952869,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,5,25]],"date-time":"2011-05-25T00:00:00Z","timestamp":1306281600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s00373-011-1055-9","type":"journal-article","created":{"date-parts":[[2011,5,24]],"date-time":"2011-05-24T13:00:49Z","timestamp":1306242049000},"page":"365-380","source":"Crossref","is-referenced-by-count":45,"title":["Token Graphs"],"prefix":"10.1007","volume":"28","author":[{"given":"Ruy","family":"Fabila-Monroy","sequence":"first","affiliation":[]},{"given":"David","family":"Flores-Pe\u00f1aloza","sequence":"additional","affiliation":[]},{"given":"Clemens","family":"Huemer","sequence":"additional","affiliation":[]},{"given":"Ferran","family":"Hurtado","sequence":"additional","affiliation":[]},{"given":"Jorge","family":"Urrutia","sequence":"additional","affiliation":[]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,25]]},"reference":[{"issue":"3","key":"1055_CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/PL00009259","volume":"23","author":"V. Auletta","year":"1999","unstructured":"Auletta V., Monti A., Parente M., Persiano P.: A linear-time algorithm for the feasibility of pebble motion on trees. Algorithmica 23(3), 223\u2013245 (1999). doi: 10.1007\/PL00009259","journal-title":"Algorithmica"},{"issue":"3","key":"1055_CR2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/jgt.3190010306","volume":"1","author":"J.A. Bondy","year":"1977","unstructured":"Bondy J.A., Hemminger R.L.: Graph reconstruction\u2014a survey. J. Graph Theory 1(3), 227\u2013268 (1977). doi: 10.1002\/jgt.3190010306","journal-title":"J. Graph Theory"},{"key":"1055_CR3","first-page":"155","volume":"35","author":"S.y. Choi","year":"1989","unstructured":"Choi S.y.: On the maximal {0, 1, 2, \u2026 , t}-cliques of J(n, k). Utilitas. Math. 35, 155\u2013167 (1989)","journal-title":"Utilitas. Math."},{"key":"1055_CR4","unstructured":"Daven, M., Rodger, C.A.: The Johnson graph J(v, k) has connectivity \u03b4. In: Proc. 30th Southeastern International Conf. on Combinatorics, Graph Theory, and Computing. Congr. Numer., vol. 139, pp. 123\u2013128 (1999)"},{"key":"1055_CR5","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph theory, Graduate Texts in Mathematics, vol. 173, 3rd edn. Springer, Berlin. http:\/\/diestel-graph-theory.com\/index.html (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"issue":"2","key":"1055_CR6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(96)00104-7","volume":"70","author":"T. Etzion","year":"1996","unstructured":"Etzion T., Bitan S.: On the chromatic number, colorings, and codes of the Johnson graph. Discret. Appl. Math. 70(2), 163\u2013175 (1996). doi: 10.1016\/0166-218X(96)00104-7","journal-title":"Discret. Appl. Math."},{"key":"1055_CR7","volume-title":"Combinatorial Identities. A Standardized Set of Tables Listing 500 Binomial Coefficient Summations","author":"H.W. Gould","year":"1972","unstructured":"Gould H.W.: Combinatorial Identities. A Standardized Set of Tables Listing 500 Binomial Coefficient Summations. Henry W. Gould, Morgantown (1972)"},{"key":"1055_CR8","doi-asserted-by":"crossref","unstructured":"Harborth, H.: Number of odd binomial coefficients. Proc. Am. Math. Soc. 62(1):19\u201322 (1977). doi: 10.2307\/2041936","DOI":"10.2307\/2041936"},{"issue":"1","key":"1055_CR9","first-page":"41","volume":"3","author":"H.R. Ho","year":"2007","unstructured":"Ho H.R.: Hamiltonicity of the graph G(n, k) of the Johnson scheme. J. Inform. 3(1), 41\u201347 (2007)","journal-title":"J. Inform."},{"key":"1055_CR10","unstructured":"Hurlbert, G.: A survey of graph pebbling. Congressus Numerantium. 139, 41\u201364 (1999). arXiv:math\/0406024"},{"key":"1055_CR11","first-page":"25","volume":"49","author":"G. Hurlbert","year":"2005","unstructured":"Hurlbert G.: Recent progress in graph pebbling. Graph Theory Notes N Y 49, 25\u201337 (2005)","journal-title":"Graph Theory Notes N Y"},{"key":"1055_CR12","unstructured":"II, F.P.M., Caro, J.D., Adorna, H.N., Baes, G.: On the wide-diameter of the Johnson graph J(n, k). Loyola Sch. Rev. 1, 77\u201388 (2001)"},{"issue":"2","key":"1055_CR13","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1006\/jcph.1997.5809","volume":"137","author":"D. Jacobs","year":"1997","unstructured":"Jacobs D., Hendrickson B.: An algorithm for two dimensional rigidity percolation: the pebble game. J. Comput. Phys. 137(2), 346\u2013365 (1997). doi: 10.1006\/jcph.1997.5809","journal-title":"J. Comput. Phys."},{"key":"1055_CR14","doi-asserted-by":"crossref","first-page":"4051","DOI":"10.1103\/PhysRevLett.75.4051","volume":"75","author":"D. Jacobs","year":"1995","unstructured":"Jacobs D., Thorpe M.F.: Generic rigidity percolation: the pebble game. Phys. Rev. Lett. 75, 4051\u20134054 (1995). doi: 10.1103\/PhysRevLett.75.4051","journal-title":"Phys. Rev. Lett."},{"issue":"2","key":"1055_CR15","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/j.jcta.2005.06.005","volume":"112","author":"L. Ji","year":"2005","unstructured":"Ji L.: A new existence proof for large sets of disjoint Steiner triple systems. J. Comb. Theory Ser. A 112(2), 308\u2013327 (2005). doi: 10.1016\/j.jcta.2005.06.005","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"1055_CR16","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00052108","volume":"71","author":"G. Larcher","year":"1996","unstructured":"Larcher G.: On the number of odd binomial coefficients. Acta. Math. Hungar. 71(3), 183\u2013203 (1996). doi: 10.1007\/BF00052108","journal-title":"Acta. Math. Hungar."},{"key":"1055_CR17","unstructured":"Lu, J.X.: On large sets of disjoint Steiner triple systems. I\u2013VI. J. Comb. Theory Ser. A 34(2):140\u2013146, 147\u2013155, 156\u2013182; 37(2):136\u2013163, 164\u2013188, 189\u2013192 (1983\u20131984)"},{"issue":"1-3","key":"1055_CR18","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.disc.2004.07.033","volume":"302","author":"C. Merino","year":"2005","unstructured":"Merino C.: The chip-firing game. Discret. Math. 302(1-3), 188\u2013210 (2005). doi: 10.1016\/j.disc.2004.07.033","journal-title":"Discret. Math."},{"key":"1055_CR19","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Raghavan, P., Sudan, M., Tamaki, H.: Motion planning on a graph. In: Proc. 35th Annual Symp. on Foundations of Comput. Sci. (FOCS \u201994), pp. 511\u2013520. IEEE, Washington (1994). doi: 10.1109\/SFCS.1994.365740","DOI":"10.1109\/SFCS.1994.365740"},{"key":"1055_CR20","unstructured":"Ruskey, F.: Combinatorial Generation. http:\/\/www.1stworks.com\/ref\/RuskeyCombGen.pdf (2003)"},{"issue":"4","key":"1055_CR21","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C. Savage","year":"1997","unstructured":"Savage C.: A survey of combinatorial Gray codes. SIAM Rev. 39(4), 605\u2013629 (1997). doi: 10.1137\/S0036144595295272","journal-title":"SIAM Rev."},{"key":"1055_CR22","unstructured":"Savage, J.E.: Models of Computation: Exploring the Power of Computing. Addison-Wesley, Boston. http:\/\/www.cs.brown.edu\/~jes\/book\/home.html (1997b)"},{"key":"1055_CR23","unstructured":"Sprugnoli, R.: Riordan array proofs of identities in Gould\u2019s book. http:\/\/www.dsi.unifi.it\/~resp\/GouldBK.pdf (2006)"},{"issue":"2","key":"1055_CR24","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0097-3165(91)90053-J","volume":"57","author":"L. Teirlinck","year":"1991","unstructured":"Teirlinck L.: A completion of Lu\u2019s determination of the spectrum of large sets of disjoint Steiner triple systems. J. Comb. Theory Ser. A 57(2), 302\u2013305 (1991). doi: 10.1016\/0097-3165(91)90053-J","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2\u20133","key":"1055_CR25","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579226","volume":"4","author":"R.M. Wilson","year":"1984","unstructured":"Wilson R.M.: The exact bound in the Erd\u0151s-Ko-Rado theorem. Combinatorica 4(2\u20133), 247\u2013257 (1984). doi: 10.1007\/BF02579226","journal-title":"Combinatorica"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1055-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1055-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1055-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T03:17:26Z","timestamp":1560223046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1055-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,25]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["1055"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1055-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,25]]}}}