{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T02:09:54Z","timestamp":1648692594726},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1987,8]]},"DOI":"10.1007\/bf00292113","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T16:13:40Z","timestamp":1096992820000},"page":"447-459","source":"Crossref","is-referenced-by-count":1,"title":["A result on k-valent graphs and its application to a graph embedding problem"],"prefix":"10.1007","volume":"24","author":[{"given":"Paul E.","family":"Dunne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1980","unstructured":"Berge, C.: Graphs and Hypergraphs. Amsterdam: North-Holland 1980"},{"key":"CR2","unstructured":"Dunne, P.E.: Improved Upper Bounds on the Area Required to Embed Arbitrary Graphs; Theory of Computation Rep. No. 55, (unpublished internal report), Dept. of Comput. Sci., Univ. of Warwick 1983"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Leiserson, C.: Area-efficient Graph Layouts (for VLSI), Proc. 21st IEEE Symposium on foundations of Comput. Sci., pp. 270?281 (1980)","DOI":"10.1109\/SFCS.1980.13"},{"key":"CR4","volume-title":"Introduction to VLSI Systems","author":"C. Mead","year":"1980","unstructured":"Mead, C., Conway, L.: Introduction to VLSI Systems. Reading, Mass.: Addison-Wesley 1980"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"L.G. Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits; IEEE Trans. Comput. 30, 135?140 (1981)","journal-title":"IEEE Trans. Comput."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00292113.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00292113\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00292113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:16:24Z","timestamp":1554758184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00292113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["BF00292113"],"URL":"https:\/\/doi.org\/10.1007\/bf00292113","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}