{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:49Z","timestamp":1740107149094,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T00:00:00Z","timestamp":1549670400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3 o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2012\/24597-3","2013\/03447-6"],"award-info":[{"award-number":["2012\/24597-3","2013\/03447-6"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3 o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/03447-6"],"award-info":[{"award-number":["2013\/03447-6"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["308523\/2012-1","308523\/2012-1"],"award-info":[{"award-number":["308523\/2012-1","308523\/2012-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["456792\/2014-7","456792\/2014-7"],"award-info":[{"award-number":["456792\/2014-7","456792\/2014-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["456792\/2014-7"],"award-info":[{"award-number":["456792\/2014-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3 o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/03447-6","2015\/10323-7"],"award-info":[{"award-number":["2013\/03447-6","2015\/10323-7"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Projet International de Coop\u00e9ration Scientifique","award":["PICS06316"],"award-info":[{"award-number":["PICS06316"]}]},{"name":"Programa para el Desarrollo Profesional Docente","award":["DSA\/103.5\/16\/10419"],"award-info":[{"award-number":["DSA\/103.5\/16\/10419"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s00373-019-02011-8","type":"journal-article","created":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T01:53:41Z","timestamp":1549677221000},"page":"539-550","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Counting Hamiltonian Cycles in the Matroid Basis Graph"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5259-2859","authenticated-orcid":false,"given":"Cristina G.","family":"Fernandes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0990-2284","authenticated-orcid":false,"given":"C\u00e9sar","family":"Hern\u00e1ndez-V\u00e9lez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 C.","family":"de Pina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge Luis","family":"Ram\u00edrez Alfons\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,9]]},"reference":[{"key":"2011_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01788672","volume":"5","author":"B Alspach","year":"1989","unstructured":"Alspach, B., Liu, G.: Paths and cycles in matroid base graphs. Graphs Comb. 5, 207\u2013211 (1989)","journal-title":"Graphs Comb."},{"issue":"1","key":"2011_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0095-8956(76)90064-2","volume":"20","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Ingleton, A.W.: Pancyclic graphs II. J. Comb. Theory Ser. B 20(1), 41\u201346 (1976)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2011_CR3","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, Graduate Texts in Mathematics, vol. 244. Springer, New York (2008)"},{"issue":"5","key":"2011_CR4","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.ejc.2005.01.008","volume":"27","author":"JE Bonin","year":"2006","unstructured":"Bonin, J.E., de Mier, A.: Lattice path matroids: structural properties. Eur. J. Comb. 27(5), 701\u2013738 (2006)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"2011_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0097-3165(03)00122-5","volume":"104","author":"JE Bonin","year":"2003","unstructured":"Bonin, J.E., de Mier, A., Noy, M.: Lattice path matroids: enumerative aspects and Tutte polynomials. J. Comb. Theory Ser. A 104(1), 63\u201394 (2003)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"2011_CR6","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.aam.2010.04.005","volume":"47","author":"V Chatelain","year":"2011","unstructured":"Chatelain, V., Ram\u00edrez Alfons\u00edn, J.L.: Matroid base polytope decomposition. Adv. Appl. Math. 47(1), 158\u2013172 (2011)","journal-title":"Adv. Appl. Math."},{"key":"2011_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.aam.2013.11.003","volume":"54","author":"V Chatelain","year":"2014","unstructured":"Chatelain, V., Ram\u00edrez Alfons\u00edn, J.L.: Matroid base polytope decomposition II: sequences of hyperplane splits. Adv. Appl. Math. 54, 121\u2013136 (2014)","journal-title":"Adv. Appl. Math."},{"key":"2011_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/TCT.1966.1082546","volume":"CT\u201313","author":"RL Cummins","year":"1966","unstructured":"Cummins, R.L.: Hamilton circuits in tree graphs. IEEE Trans. Circ. Theory CT\u201313, 82\u201390 (1966)","journal-title":"IEEE Trans. Circ. Theory"},{"issue":"2","key":"2011_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0095-8956(77)90006-5","volume":"22","author":"JD Donald","year":"1977","unstructured":"Donald, J.D., Holzmann, C.A., Tobey, M.D.: A characterization of complete matroid base graphs. J. Comb. Theory Ser. B 22(2), 139\u2013158 (1977)","journal-title":"J. Comb. Theory Ser. B"},{"unstructured":"Fernandes, C.G., Hern\u00e1ndez-V\u00e9lez, C., de Pina, J.C., Ram\u00edrez Alfons\u00edn, J.L.: Matroid basis graph: Counting Hamiltonian cycles. ArXiv (2016). \n                    arXiv:1608.02635","key":"2011_CR10"},{"doi-asserted-by":"crossref","unstructured":"Gel\n                    \n                      \n                    \n                    $$^{\\prime }$$\n                    \n                      \n                        \n                          \n                          \u2032\n                        \n                      \n                    \n                  fand, I.M., Serganova, V.V.: Combinatorial geometries and the strata of a torus on homogeneous compact manifolds. Uspekhi Mat. Nauk 42(2(254)), 107\u2013134, 287 (1987)","key":"2011_CR11","DOI":"10.1070\/RM1987v042n02ABEH001308"},{"issue":"1","key":"2011_CR12","first-page":"59","volume":"3","author":"GZ Liu","year":"1984","unstructured":"Liu, G.Z.: The connectivity of matroid base graphs. Chin. J. Oper. Res. 3(1), 59\u201360 (1984)","journal-title":"Chin. J. Oper. Res."},{"issue":"2","key":"2011_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0012-365X(88)90073-8","volume":"71","author":"GZ Liu","year":"1988","unstructured":"Liu, G.Z.: Erratum: \u201cA lower bound on connectivities of matroid base graphs\u201d. Discrete Math. 71(2), 187 (1988)","journal-title":"Discrete Math."},{"issue":"1","key":"2011_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0012-365X(88)90177-X","volume":"69","author":"GZ Liu","year":"1988","unstructured":"Liu, G.Z.: A lower bound on connectivities of matroid base graphs. Discrete Math. 69(1), 55\u201360 (1988)","journal-title":"Discrete Math."},{"key":"2011_CR15","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0095-8956(73)90005-1","volume":"14","author":"SB Maurer","year":"1973","unstructured":"Maurer, S.B.: Matroid basis graphs I. J. Comb. Theory Ser. B 14, 216\u2013240 (1973)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2011_CR16","volume-title":"Matroid theory, Oxford Graduate Texts in Mathematics","author":"J Oxley","year":"2011","unstructured":"Oxley, J.: Matroid theory, Oxford Graduate Texts in Mathematics, vol. 21, 2nd edn. Oxford University Press, Oxford (2011)","edition":"2"},{"key":"2011_CR17","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/TCT.1968.1082765","volume":"CT\u201315","author":"HS Shank","year":"1968","unstructured":"Shank, H.S.: A note on Hamilton circuits in tree graphs. IEEE Trans. Circ. Theory CT\u201315, 86 (1968)","journal-title":"IEEE Trans. Circ. Theory"},{"key":"2011_CR18","volume-title":"Enumerative combinatorics, second edn. Cambridge Studies in Advanced Mathematics.","author":"RP Stanley","year":"2012","unstructured":"Stanley, R.P.: Enumerative combinatorics, second edn. Cambridge Studies in Advanced Mathematics., vol. 1, 2nd edn. Cambridge University Press, Cambridge (2012)","edition":"2"},{"key":"2011_CR19","volume-title":"Matroid Theory","author":"DJA Welsh","year":"2009","unstructured":"Welsh, D.J.A.: Matroid Theory. Dover Publications Inc, New York (2009)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02011-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02011-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02011-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,8]],"date-time":"2020-02-08T19:16:30Z","timestamp":1581189390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02011-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,9]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["2011"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02011-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,2,9]]},"assertion":[{"value":"9 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}