{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:21Z","timestamp":1770972381926,"version":"3.50.1"},"reference-count":7,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7802,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1985,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let one face of a cube be dissected into rectangles, no 4 of which meet at a single point. The dual graph of this configuration is a 4\u2010connected triangulated plane graph. This paper shows that any 4\u2010connected plane triangulation with at least 6 vertices and at least one vertex of degree 4 is dual to a cube with one face dissected into rectangles. The proof of this result contains an implicit algorithm for obtaining such a dissection. The paper also discusses a related problem: Given a graph <jats:italic>G<\/jats:italic> with all faces triangular except the outer face, does there exist a dissection of a rectangle into rectangles for which <jats:italic>G<\/jats:italic> describes the adjacency relations among the rectangles?<\/jats:p>","DOI":"10.1002\/net.3230150202","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T19:21:45Z","timestamp":1178911305000},"page":"145-157","source":"Crossref","is-referenced-by-count":131,"title":["Rectangular duals of planar graphs"],"prefix":"10.1002","volume":"15","author":[{"given":"Krzysztof","family":"Ko\u017ami\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin","family":"Kinnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"J.Grason A dual linear graph representation for space filling location problems of the floor plan type. Emerging Methods in Environmental Design and Planning (G. T. Moore Ed.). Proceedings of The Design Methods Group 1st International Conference Cambridge MA (1968) pp.170\u2013178."},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"W. R.Heller G.SorkinandK.Maling The planar package planner for system designers. Proceedings of the 19th Design Automation Conference IEEE and ACM Las Vegas (1982) pp.253\u2013260.","DOI":"10.1109\/DAC.1982.1585509"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"K.Ko\u017ami\u0144ski andE.Kinnen An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits. Proceedings of the 21th Design Automation Conference IEEE and ACM Albuquerque June (1984).","DOI":"10.1109\/DAC.1984.1585872"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"K.Maling S. H.MuellerandW. H.Heller On finding most optimal rectangular package plans. Proceedings of the 19th Design Automation Conference IEEE and ACM Las Vegas June (1982) pp.663\u2013670.","DOI":"10.1109\/DAC.1982.1585567"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.4064\/fm-10-1-96-115"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1068\/b030037"},{"key":"e_1_2_1_8_2","first-page":"94","volume-title":"The Architecture of Form","author":"Steadman P.","year":"1976"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230150202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230150202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T21:22:45Z","timestamp":1697836965000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230150202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["10.1002\/net.3230150202"],"URL":"https:\/\/doi.org\/10.1002\/net.3230150202","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}