{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T22:54:47Z","timestamp":1770072887846,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T00:00:00Z","timestamp":1645574400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T00:00:00Z","timestamp":1645574400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12131013"],"award-info":[{"award-number":["12131013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871034"],"award-info":[{"award-number":["11871034"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-022-00850-5","type":"journal-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T18:03:25Z","timestamp":1645639405000},"page":"603-616","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Further results on the total monochromatic connectivity of graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Yanhong","family":"Gao","sequence":"first","affiliation":[]},{"given":"Ping","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8335-9873","authenticated-orcid":false,"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"850_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory, GTM 244","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory, GTM 244. Springer, Berlin"},{"issue":"4","key":"850_CR2","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1137\/100801251","volume":"25","author":"P Bonsma","year":"2011","unstructured":"Bonsma P, Zickfeld F (2011) A 3\/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs. SIAM J Discrete Math 25(4):1652\u20131666","journal-title":"SIAM J Discrete Math"},{"key":"850_CR3","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1007\/s10878-018-0258-x","volume":"35","author":"Q Cai","year":"2018","unstructured":"Cai Q, Li X, Wu D (2018) Some extremal results on the colorful monochromatic vertex-connectivity of a graph. J Comb Optim 35:1300\u20131311","journal-title":"J Comb Optim"},{"issue":"2","key":"850_CR4","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1137\/S0895480199353780","volume":"13","author":"Y Caro","year":"2000","unstructured":"Caro Y, West DB, Yuster R (2000) Connected domination and spanning trees with many leaves. SIAM J Discrete Math 13(2):202\u2013211","journal-title":"SIAM J Discrete Math"},{"key":"850_CR5","doi-asserted-by":"publisher","first-page":"1786","DOI":"10.1016\/j.disc.2011.04.020","volume":"311","author":"Y Caro","year":"2011","unstructured":"Caro Y, Yuster R (2011) Colorful monochromatic connectivity. Discrete Math 311:1786\u20131792","journal-title":"Discrete Math"},{"issue":"1","key":"850_CR6","doi-asserted-by":"publisher","first-page":"R33","DOI":"10.37236\/757","volume":"15","author":"E DeLaVina","year":"2008","unstructured":"DeLaVina E, Waller B (2008) Spanning trees with many leaves and average distance. Electron J Comb 15(1):R33","journal-title":"Electron J Comb"},{"key":"850_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/jgt.1013","volume":"37","author":"G Ding","year":"2001","unstructured":"Ding G, Johnson T, Seymour P (2001) Spanning trees with many leaves. J Graph Theory 37:189\u2013197","journal-title":"J Graph Theory"},{"key":"850_CR8","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.2428","author":"Y Gao","year":"2020","unstructured":"Gao Y, Li P, Li X (2020) Extremal graphs and classification of planar graphs by MC-numbers. Discuss Math Graph Theory. https:\/\/doi.org\/10.7151\/dmgt.2428","journal-title":"Discuss Math Graph Theory"},{"issue":"2","key":"850_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0012-365X(92)90331-9","volume":"104","author":"JR Griggs","year":"1992","unstructured":"Griggs JR, Wu M (1992) Spanning trees in graphs of minimum degree 4 or 5. Discrete Math 104(2):167\u2013183","journal-title":"Discrete Math"},{"key":"850_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.disc.2016.08.020","volume":"340","author":"H Jiang","year":"2017","unstructured":"Jiang H, Li X, Zhang Y (2017) Total monochromatic connection of graphs. Discrete Math 340:175\u2013180","journal-title":"Discrete Math"},{"key":"850_CR11","first-page":"263","volume":"136","author":"H Jiang","year":"2018","unstructured":"Jiang H, Li X, Zhang Y (2018) More on total monochromatic connection of graphs. Ars Combin 136:263\u2013275","journal-title":"Ars Combin"},{"issue":"1","key":"850_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0404010","volume":"4","author":"DJ Kleitman","year":"1991","unstructured":"Kleitman DJ, West DB (1991) Spanning trees with many leaves. SIAM J Discrete Math 4(1):99\u2013106","journal-title":"SIAM J Discrete Math"},{"key":"850_CR13","first-page":"291","volume":"48","author":"R Laskar","year":"1985","unstructured":"Laskar R, Perters K (1985) Vertex and edge domination parameters in graphs. Congr Number 48:291\u2013305","journal-title":"Congr Number"},{"key":"850_CR14","first-page":"1","volume":"4","author":"X Li","year":"2018","unstructured":"Li X, Wu D (2018) A survey on monochromatic connections of graphs. Theory Appl Gr 4:1\u201321","journal-title":"Theory Appl Gr"},{"key":"850_CR15","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1007\/s10878-016-0048-2","volume":"33","author":"X Li","year":"2017","unstructured":"Li X, Wu D (2017) The (vertex-)monochromatic index of a graph. J Comb Optim 33:1443\u20131453","journal-title":"J Comb Optim"},{"issue":"1\u20133","key":"850_CR16","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L Ruan","year":"2004","unstructured":"Ruan L, Du H, Jia X, Wu W, Li Y, Ko K (2004) A greedy approximation for minimum connected dominating sets. Theoret Comput Sci 329(1\u20133):325\u2013330","journal-title":"Theoret Comput Sci"},{"issue":"2","key":"850_CR17","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/s00453-015-0080-0","volume":"77","author":"R Solis-Oba","year":"2017","unstructured":"Solis-Oba R, Bonsma P, Lowski S (2017) A 2-approximation algorithm for finding a spanning tree with maximum number of leaves. Algorithmica 77(2):374\u2013388","journal-title":"Algorithmica"},{"key":"850_CR18","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/s10878-014-9720-6","volume":"31","author":"Y Shi","year":"2016","unstructured":"Shi Y, Zhang Y, Zhang Z, Wu W (2016) A greedy algorithm for the minimum 2-connected $$m$$-fold dominating set problem. J Comb Optim 31:136\u2013151","journal-title":"J Comb Optim"},{"key":"850_CR19","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/s10878-013-9638-4","volume":"28","author":"J Zhou","year":"2014","unstructured":"Zhou J, Zhang Z, Wu W, Xing K (2014) A greedy algorithm for the fault-tolerant connected dominating set in a general graph. J Comb Optim 28:310\u2013319","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00850-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00850-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00850-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:31:16Z","timestamp":1659079876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00850-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,23]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["850"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00850-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,23]]},"assertion":[{"value":"31 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}