{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:49Z","timestamp":1760202469332},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":6864,"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":[[1994,10]]},"DOI":"10.1016\/0012-365x(94)90036-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"291-296","source":"Crossref","is-referenced-by-count":21,"title":["On the k-diameter of k-regular k-connected graphs"],"prefix":"10.1016","volume":"133","author":[{"given":"D.","family":"Frank Hsu","sequence":"first","affiliation":[]},{"given":"Tomasz","family":"\u0141uczak","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)90036-1_BIB1","article-title":"Diameter of graphs: Old problems and new results","author":"Chung","year":"1987","journal-title":"18th Southeastern Conf. on Combinatorics"},{"key":"10.1016\/0012-365X(94)90036-1_BIB2","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1109\/12.223681","article-title":"Line digraph iteration and connectivity analysis of de Bruijin and Kautz graphs","volume":"42","author":"Du","year":"1993","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0012-365X(94)90036-1_BIB3","first-page":"235","article-title":"Menger's theorem and short paths","volume":"2","author":"Faudree","year":"1987","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/0012-365X(94)90036-1_BIB4","unstructured":"D.F. Hsu, On container width and length in graphs, groups and networks, to appear."},{"key":"10.1016\/0012-365X(94)90036-1_BIB5","first-page":"20","article-title":"A graph theoretical study of transmission delay and fault tolerance","author":"Hsu","year":"1991","journal-title":"Proceedings of the 4th ISMM International Conference on Parallel and Distributed Computing and Systems"},{"issue":"3","key":"10.1016\/0012-365X(94)90036-1_BIB6","first-page":"472","article-title":"Flip trees","volume":"37","author":"Meyer","year":"1987","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0012-365X(94)90036-1_BIB7","first-page":"191","article-title":"Fault-tolerant networks and graph connectivity","volume":"1","author":"Ordman","year":"1987","journal-title":"J. Combin. Math. Combin. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94900361?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94900361?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:21:50Z","timestamp":1555136510000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X94900361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0012365X94900361"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)90036-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}