We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Uniqueness of rectangularly dualizable graphs.
- Authors
Kumar, Vinod; Shekhawaty, Krishnendra
- Abstract
A generic rectangular partition is a partition of a rectangle into a finite number of rectangles provided that no four of them meet at a point. A graph H is called dual of a plane graph G if there is one-to-one correspondence between the vertices of G and the regions of H, and two vertices of G are adjacent if and only if the corresponding regions of H are adjacent. A plane graph is a rectangularly dualizable graph if its dual can be embedded as a rectangular partition. A rectangular dual R of a plane graph G is a partition of a rectangle into n-rectangles such that (i) no four rectangles of R meet at a point, (ii) rectangles in R are mapped to vertices of G, and (iii) two rectangles in R share a common boundary segment if and only if the corresponding vertices are adjacent in G. In this paper, we derive a necessary and sufficient for a rectangularly dualizable graph G to admit a unique rectangular dual upto combinatorial equivalence. Further we show that G always admits a slicible as well as an area-universal rectangular dual.
- Subjects
GRAPH theory; PARTITIONS (Mathematics); GEOMETRIC vertices; RECTANGLES; MATHEMATICAL equivalence
- Publication
Communications in Combinatorics & Optimization, 2024, Vol 9, Issue 1, p13
- ISSN
2538-2128
- Publication type
Article
- DOI
10.22049/cco.2022.27774.1350