{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,28]],"date-time":"2024-09-28T04:27:19Z","timestamp":1727497639513},"reference-count":0,"publisher":"Journal of Graph Algorithms and Applications","issue":"1","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JGAA"],"abstract":"We introduce a new type of graph drawing called \"rook-drawing\".\nA rook-drawing of a graph $G$ is obtained by placing the $n$ nodes of $G$ on the intersections of a regular grid, such that each row and column of the grid supports exactly one node. \nThis paper focuses on rook-drawings of planar graphs.\nWe first give a linear algorithm to compute a planar straight-line rook-drawing for outerplanar graphs.\nWe then characterize the maximal planar graphs admitting a planar straight-line rook-drawing, which are unique for a given order.\nFinally, we give a linear time algorithm to compute a polyline planar rook-drawing for plane graphs with at most $n-3$ bent edges.<\/jats:p>","DOI":"10.7155\/jgaa.00402","type":"journal-article","created":{"date-parts":[[2016,9,16]],"date-time":"2016-09-16T08:05:38Z","timestamp":1474013138000},"page":"103-120","source":"Crossref","is-referenced-by-count":1,"title":["Rook-drawings of Plane Graphs"],"prefix":"10.7155","volume":"21","author":[{"given":"David","family":"Auber","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Bonichon","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Dorbec","sequence":"additional","affiliation":[]},{"given":"Claire","family":"Pennarun","sequence":"additional","affiliation":[]}],"member":"4175","published-online":{"date-parts":[[2017,1,1]]},"container-title":["Journal of Graph Algorithms and Applications"],"original-title":[],"link":[{"URL":"https:\/\/jgaa.info\/index.php\/jgaa\/article\/download\/paper402\/2554","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/jgaa.info\/index.php\/jgaa\/article\/download\/paper402\/2554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T20:30:34Z","timestamp":1727469034000},"score":1,"resource":{"primary":{"URL":"https:\/\/jgaa.info\/index.php\/jgaa\/article\/view\/paper402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,1]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,1,1]]}},"URL":"https:\/\/doi.org\/10.7155\/jgaa.00402","relation":{},"ISSN":["1526-1719"],"issn-type":[{"type":"electronic","value":"1526-1719"}],"subject":[],"published":{"date-parts":[[2017,1,1]]}}}