{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:07Z","timestamp":1740122467151,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T00:00:00Z","timestamp":1559779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T00:00:00Z","timestamp":1559779200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10878-019-00426-w","type":"journal-article","created":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T10:02:54Z","timestamp":1559815374000},"page":"887-910","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Characterizations of matroids with an element lying in a restricted number of circuits"],"prefix":"10.1007","volume":"38","author":[{"given":"Ping","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7698-2125","authenticated-orcid":false,"given":"Hong-Jian","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,6]]},"reference":[{"key":"426_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01788672","volume":"5","author":"B Alspach","year":"1989","unstructured":"Alspach B, Liu G (1989) Paths and cycles in matroid base graphs. Graphs Combin 5:207\u2013211","journal-title":"Graphs Combin"},{"key":"426_CR2","volume-title":"Extremal graph theory","author":"B Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s B (1978) Extremal graph theory. Academic Press, Cambridge"},{"key":"426_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory. Springer, New York"},{"key":"426_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1090\/S0002-9947-1972-0309764-6","volume":"171","author":"TH Brylawski","year":"1972","unstructured":"Brylawski TH (1972) A decomposition for combinatorial geometries. Trans Am Math Soc 171:235\u2013282","journal-title":"Trans Am Math Soc"},{"issue":"8","key":"426_CR5","doi-asserted-by":"publisher","first-page":"1810","DOI":"10.1016\/j.ejc.2008.12.001","volume":"30","author":"R Cordovil","year":"2009","unstructured":"Cordovil R, Lemos M, Maia B Jr (2009) The 3-connected binary matroids with circumference 6 or 7. Eur J Combin 30(8):1810\u20131824","journal-title":"Eur J Combin"},{"key":"426_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1965-035-8","volume":"17","author":"P Erd\u00f6s","year":"1965","unstructured":"Erd\u00f6s P, P\u00f3sa L (1965) On independent circuits contained in a graph. Can J Math 17:347\u2013352","journal-title":"Can J Math"},{"key":"426_CR7","first-page":"153","volume":"97A","author":"S Fan","year":"2010","unstructured":"Fan S, Lai H-J, Shao Y, Wu H, Zhou J (2010) Regular matroids without disjoint circuits. Ars Combin 97A:153\u2013159","journal-title":"Ars Combin"},{"issue":"6","key":"426_CR8","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1002\/jgt.3190130606","volume":"13","author":"F Harary","year":"1989","unstructured":"Harary F, Plantholt MJ (1989) Classification of interpolation theorems for spanning trees and other families of spanning subgraphs. J Graph Theory 13(6):703\u2013712","journal-title":"J Graph Theory"},{"key":"426_CR9","first-page":"187","volume":"22","author":"CA Holzman","year":"1972","unstructured":"Holzman CA, Harary F (1972) On the tree graph of a matroid. Adv Math 22:187\u2013193","journal-title":"Adv Math"},{"issue":"4","key":"426_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1017\/S0963548301004710","volume":"10","author":"BM Junior","year":"2001","unstructured":"Junior BM, Lemos M (2001) Matroids having small circumference. Combin Probab Comput 10(4):349\u2013360","journal-title":"Combin Probab Comput"},{"key":"426_CR11","doi-asserted-by":"publisher","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K Kuratowski","year":"1930","unstructured":"Kuratowski K (1930) Sur le probl\u00e8me des courbes gauches wen topologie. Fund Math 15:271\u2013283","journal-title":"Fund Math"},{"key":"426_CR12","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/j.ejc.2011.01.012","volume":"32","author":"M Lemos","year":"2011","unstructured":"Lemos M, Reid TJ, Wu H (2011) On the circuit-spectrum of binary matroids. Eur J Combin 32:861\u2013869","journal-title":"Eur J Combin"},{"issue":"6","key":"426_CR13","first-page":"49","volume":"39","author":"L Li","year":"2004","unstructured":"Li L, Liu G (2004) The connectivities of the adjacency leaf exchange forest graphs. J Shandong Univ 39(6):49\u201351","journal-title":"J Shandong Univ"},{"key":"426_CR14","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s00373-007-0739-7","volume":"23","author":"P Li","year":"2007","unstructured":"Li P, Liu G (2007) Cycles in circuit graphs of matroids. Graphs Combin 23:425\u2013431","journal-title":"Graphs Combin"},{"key":"426_CR15","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.camwa.2007.04.039","volume":"55","author":"P Li","year":"2008","unstructured":"Li P, Liu G (2008) Hamilton cycles in circuit graphs of matroids. Comput Math Appl 55:654\u2013659","journal-title":"Comput Math Appl"},{"key":"426_CR16","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10114-010-6685-y","volume":"26","author":"P Li","year":"2010","unstructured":"Li P, Liu G (2010) The connectivity and minimum degree of circuit graphs of matroids. Acta Mathematica Sinica 26:353\u2013360","journal-title":"Acta Mathematica Sinica"},{"key":"426_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0012-365X(88)90177-X","volume":"64","author":"G Liu","year":"1988","unstructured":"Liu G (1988) A lower bound on connectivities of matroid base graphs. Discret Math 64:55\u201366","journal-title":"Discret Math"},{"issue":"A","key":"426_CR18","first-page":"593","volume":"6","author":"G Liu","year":"1990","unstructured":"Liu G (1990) The proof of a conjecture on matroid basis graphs. Sci China 6(A):593\u2013599","journal-title":"Sci China"},{"key":"426_CR19","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.tcs.2008.01.033","volume":"396","author":"G Liu","year":"2008","unstructured":"Liu G, Li P (2008) Paths in circuit graphs of matroids. Theoret Comput Sci 396:258\u2013263","journal-title":"Theoret Comput Sci"},{"issue":"6","key":"426_CR20","first-page":"1100","volume":"22","author":"G Liu","year":"2005","unstructured":"Liu G, Zhang L (2005) Forest graphs of graphs. Chin J Eng Math 22(6):1100\u20131104","journal-title":"Chin J Eng Math"},{"key":"426_CR21","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0095-8956(73)90005-1","volume":"14","author":"SB Maurer","year":"1973","unstructured":"Maurer SB (1973) Matroid basis graphs 1. J Comb Theory Ser B 14:216\u2013240","journal-title":"J Comb Theory Ser B"},{"key":"426_CR22","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0095-8956(73)90013-0","volume":"15","author":"SB Maurer","year":"1973","unstructured":"Maurer SB (1973) Matroid basis graphs 2. J Comb Theory Ser B 15:121\u2013145","journal-title":"J Comb Theory Ser B"},{"key":"426_CR23","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/0095-8956(71)90021-9","volume":"11","author":"USR Murty","year":"1971","unstructured":"Murty USR (1971) Equicardinal matroids. J Combin Theory Ser B 11:120\u2013126","journal-title":"J Combin Theory Ser B"},{"key":"426_CR24","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0012-365X(74)90109-5","volume":"8","author":"USR Murty","year":"1974","unstructured":"Murty USR (1974) Extremal critically connected matroids. Discret Math 8:49\u201358","journal-title":"Discret Math"},{"key":"426_CR25","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001","volume-title":"Matroid theory","author":"JG Oxley","year":"2011","unstructured":"Oxley JG (2011) Matroid theory, 2nd edn. Oxford University Press, New York","edition":"2"},{"key":"426_CR26","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0095-8956(77)90077-6","volume":"22","author":"PD Seymour","year":"1977","unstructured":"Seymour PD (1977) A note on the production of matroid minors. J Combin Theory Ser B 22:289\u2013295","journal-title":"J Combin Theory Ser B"},{"key":"426_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.6028\/jres.069B.001","volume":"69B","author":"WT Tutte","year":"1965","unstructured":"Tutte WT (1965) Lectures on matroids. J Res Nat Bur Stand Sect 69B:1\u201348","journal-title":"J Res Nat Bur Stand Sect"},{"key":"426_CR28","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/BF01594196","volume":"114","author":"K Wagner","year":"1937","unstructured":"Wagner K (1937) \u00dcber eine Eigenschaft der ebenen Komplex. Math Ann 114:570\u2013590","journal-title":"Math Ann"},{"key":"426_CR29","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s00373-011-1074-6","volume":"28","author":"J Xu","year":"2012","unstructured":"Xu J, Li P, Lai H-J (2012) Connectivity and diameter of second order circuit graphs of matroids. Graphs Combin 28:737\u2013742","journal-title":"Graphs Combin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00426-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00426-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00426-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,4]],"date-time":"2020-06-04T23:05:50Z","timestamp":1591311950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00426-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,6]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["426"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00426-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,6,6]]},"assertion":[{"value":"6 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}