{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T03:08:48Z","timestamp":1764644928314},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8233,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0012-365x(91)90068-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"29-40","source":"Crossref","is-referenced-by-count":19,"title":["Label-connected graphs and the gossip problem"],"prefix":"10.1016","volume":"87","author":[{"given":"F.","family":"G\u00f6bel","sequence":"first","affiliation":[]},{"given":"J.Orestes","family":"Cerdeira","sequence":"additional","affiliation":[]},{"given":"H.J.","family":"Veldman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90068-D_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(91)90068-D_BIB2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0602002","article-title":"A problem with telephones","volume":"2","author":"Bumby","year":"1981","journal-title":"Siam J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(91)90068-D_BIB3","author":"Catlin","year":"1986","journal-title":"Removing forests to find spanning eulerian subgraphs"},{"key":"10.1016\/0012-365X(91)90068-D_BIB4","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(91)90068-D_BIB5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1002\/bs.3830190207","article-title":"Efficiency of dissemination of information in one-way and two-way communication networks","volume":"19","author":"Harary","year":"1974","journal-title":"Behavioral Sci."},{"key":"10.1016\/0012-365X(91)90068-D_BIB6","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/0016-0032(74)90126-4","article-title":"The communication problem of graphs and digraphs","volume":"297","author":"Harary","year":"1974","journal-title":"J. Franklin Inst."},{"key":"10.1016\/0012-365X(91)90068-D_BIB7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0012-365X(80)90116-8","article-title":"Further gossip problems","volume":"30","author":"Kleitman","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(91)90068-D_BIB8","series-title":"Combinatorial Optimization, Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0012-365X(91)90068-D_BIB9","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","article-title":"Edge-disjoint spanning trees of finite graphs","volume":"36","author":"Nash\u2013Williams","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(91)90068-D_BIB10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","article-title":"On the problem of decomposing a graph into n connected factors","volume":"36","author":"Tutte","year":"1961","journal-title":"J. London Math. Soc."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190068D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190068D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:56:30Z","timestamp":1555134990000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9190068D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0012365X9190068D"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90068-d","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}