{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:49Z","timestamp":1770972409154,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"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":12616,"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":[[1979]]},"DOI":"10.1016\/0012-365x(79)90131-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"237-245","source":"Crossref","is-referenced-by-count":17,"title":["Generalized fibonacci maximum path graphs"],"prefix":"10.1016","volume":"28","author":[{"given":"Martin Charles","family":"Golumbic","sequence":"first","affiliation":[]},{"given":"Yehoshua","family":"Perl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(79)90131-6_BIB1","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1109\/TCT.1968.1082837","article-title":"On finding the simple paths and circuits in a graph","volume":"CT-1S","author":"Danielson","year":"1968","journal-title":"IEEE TRANS Circuit Theory"},{"key":"10.1016\/0012-365X(79)90131-6_BIB2_1","series-title":"Generalized Fibonacci graphs","author":"Golumbic","year":"1977"},{"key":"10.1016\/0012-365X(79)90131-6_BIB2_2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0022-247X(66)90020-5","article-title":"The shortest route problem with constraints","volume":"14","author":"Joksch","year":"1966","journal-title":"J. of Math. Analysis and Applications"},{"key":"10.1016\/0012-365X(79)90131-6_BIB4","series-title":"Maximum path graphs","author":"Perl","year":"1976"},{"key":"10.1016\/0012-365X(79)90131-6_BIB5","series-title":"Information Technology","first-page":"211","article-title":"Shortest paths in a network with two cost functions","author":"Perl","year":"1978"},{"key":"10.1016\/0012-365X(79)90131-6_BIB6","series-title":"Deficient generalized Fibonacci maximum path graphs","author":"Perl","year":"1978"},{"key":"10.1016\/0012-365X(79)90131-6_BIB7","first-page":"379","article-title":"On finding the paths through a network","volume":"51","author":"Sloane","year":"1972","journal-title":"Bell Syst. J."},{"key":"10.1016\/0012-365X(79)90131-6_BIB8","series-title":"Ph.D. Thesis","article-title":"Solution algorithms for resource and route constrained shortest path problems in time dependent transportation networks","author":"Yucaoglu","year":"1973"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79901316?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79901316?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:23:39Z","timestamp":1555154619000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X79901316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979]]}},"alternative-id":["0012365X79901316"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(79)90131-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1979]]}}}