{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:54Z","timestamp":1759638714623},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":5525,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0166-218x(98)00028-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:13:42Z","timestamp":1027610022000},"page":"139-147","source":"Crossref","is-referenced-by-count":4,"title":["A communication problem and directed triple systems"],"prefix":"10.1016","volume":"85","author":[{"given":"Andr\u00e1s","family":"Gy\u00e1rf\u00e1s","sequence":"first","affiliation":[]},{"given":"R.H.","family":"Schelp","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00028-6_BIB1","first-page":"97","article-title":"An analysis of directed triple systems by refinement","volume":"15","author":"Colbourn","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(98)00028-6_BIB2","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1002\/net.3230220702","article-title":"Networks communicating for each pairing of terminal","volume":"22","author":"Csaba","year":"1992","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00028-6_BIB3","first-page":"111","article-title":"Minimal path pairable graphs","volume":"88","author":"Faudree","year":"1992"},{"key":"10.1016\/S0166-218X(98)00028-6_BIB4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01271707","article-title":"Three regular path pairable graphs","volume":"8","author":"Faudree","year":"1992","journal-title":"Graphs Combin."},{"key":"10.1016\/S0166-218X(98)00028-6_BIB5","series-title":"Combinatorial Theory","author":"Hall","year":"1986"},{"key":"10.1016\/S0166-218X(98)00028-6_BIB6","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000286?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000286?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T11:50:28Z","timestamp":1556365828000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000286"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0166218X98000286"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00028-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}