{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:24:24Z","timestamp":1648981464818},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":5707,"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":[[1997,12]]},"DOI":"10.1016\/s0012-365x(96)00362-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:07:13Z","timestamp":1027613233000},"page":"167-184","source":"Crossref","is-referenced-by-count":0,"title":["Edge frames of graphs: A graph embedding problem"],"prefix":"10.1016","volume":"177","author":[{"given":"Hiren","family":"Maharaj","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00362-7_BIB1","first-page":"17","article-title":"Derived graphs and digraphs","author":"Beineke","year":"1968","journal-title":"Beitr\u00e4ge zur Graphentheorie"},{"key":"10.1016\/S0012-365X(96)00362-7_BIB2","first-page":"35","article-title":"Framed! A graph embedding problem","volume":"4","author":"Chartrand","year":"1992","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/S0012-365X(96)00362-7_BIB3","unstructured":"G. Chartrand, M.A. Henning, H. Hevia and E. Jarrett, A new characterization of the Petersen graph, J. Combin. Inform System Sci., to appear."},{"key":"10.1016\/S0012-365X(96)00362-7_BIB4","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/S0012-365X(96)00362-7_BIB5","first-page":"111","article-title":"On graphs and their frames","volume":"1","author":"Gavlas","year":"1992","journal-title":"Vishwa Internat. J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00362-7_BIB6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1080\/16073606.1993.9631738","article-title":"Some general results on the framing number of a graph","volume":"16","author":"Goddard","year":"1993","journal-title":"Quaestiones Math."},{"key":"10.1016\/S0012-365X(96)00362-7_BIB7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1080\/16073606.1993.9631736","article-title":"Which trees are uniquely framed by the Heawood graph","volume":"16","author":"Goddard","year":"1993","journal-title":"Quaestiones Math."},{"key":"10.1016\/S0012-365X(96)00362-7_BIB8","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","article-title":"Congruent graphs and the connectivity of graphs","volume":"54","author":"Whitney","year":"1932","journal-title":"Amer. J. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003627?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003627?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T11:22:44Z","timestamp":1556277764000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96003627"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0012365X96003627"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00362-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}