{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T17:16:13Z","timestamp":1758820573823,"version":"3.44.0"},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100007942","name":"Tianjin Normal University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007942","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","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","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1016\/j.amc.2020.125323","type":"journal-article","created":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T00:29:08Z","timestamp":1588897748000},"page":"125323","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Eulerian Subgraphs and S-connectivity of Graphs"],"prefix":"10.1016","volume":"382","author":[{"given":"Miaomiao","family":"Han","sequence":"first","affiliation":[]},{"given":"Zhengke","family":"Miao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2020.125323_bib0001","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/jgt.3190120105","article-title":"A reduction method to find spanning eulerian subgraph","volume":"12","author":"Catlin","year":"1988","journal-title":"J. Graph Theory"},{"year":"1980","series-title":"Algebra","author":"Hungerford","key":"10.1016\/j.amc.2020.125323_sbref0002"},{"key":"10.1016\/j.amc.2020.125323_bib0003","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0095-8956(92)90016-Q","article-title":"Group connetivity of graphs - a non-homogeneous analoge of newhere-zore flow property","volume":"56","author":"Jaeger","year":"1992","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/j.amc.2020.125323_bib0004","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/(SICI)1097-0118(199904)30:4<277::AID-JGT3>3.0.CO;2-D","article-title":"Extending a partial nowhere zero 4-flow","volume":"30","author":"Lai","year":"1999","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2020.125323_bib0005","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/PL00021177","article-title":"Group connectivity of 3-edge-connected chordal graphs","volume":"16","author":"Lai","year":"2000","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/j.amc.2020.125323_bib0006","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10114-010-9746-3","article-title":"Group connectivity and group colorings of graphs \u2013 a survey","volume":"27","author":"Lai","year":"2011","journal-title":"Acta Math. Sin., English Series"},{"key":"10.1016\/j.amc.2020.125323_bib0007","unstructured":"R. Langhede, C. Thomassen, Group connectivity and group coloring: small groups versus large groups, submitted."},{"key":"10.1016\/j.amc.2020.125323_bib0008","doi-asserted-by":"crossref","first-page":"1909","DOI":"10.1137\/16M1055189","article-title":"Group connectivity, strongly zm-connectivity, and edge disjoint spanning trees","volume":"31","author":"Li","year":"2017","journal-title":"SIAM J. Discrete Math."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300320302897?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300320302897?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:32:53Z","timestamp":1758817973000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300320302897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":8,"alternative-id":["S0096300320302897"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2020.125323","relation":{},"ISSN":["0096-3003"],"issn-type":[{"type":"print","value":"0096-3003"}],"subject":[],"published":{"date-parts":[[2020,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Eulerian Subgraphs and S-connectivity of Graphs","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2020.125323","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"125323"}}