| dc.contributor.author |
Shekhawat, Krishnendra |
|
| dc.date.accessioned |
2024-05-21T03:59:00Z |
|
| dc.date.available |
2024-05-21T03:59:00Z |
|
| dc.date.issued |
2024 |
|
| dc.identifier.uri |
https://nntdm.net/volume-30-2024/number-1/141-149/ |
|
| dc.identifier.uri |
http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14950 |
|
| dc.description.abstract |
A rectangular partition is a partition of a rectangle into a finite number of rectangles. A rectangular partition is generic if no four of its rectangles meet at the same point. A plane graph G is called a rectangularly dualizable graph if G can be represented as a rectangular partition such that each vertex is represented by a rectangle in the partition and each edge is represented by a common boundary segment shared by the corresponding rectangles. Then the rectangular partition is called a rectangular dual of the RDG. In this paper, we have found a minor error in a characterization for rectangular duals given by Koźmiński and Kinnen in 1985 without formal proof, and we fix this characterization with formal proof. |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
NNTDM |
en_US |
| dc.subject |
Mathematics |
en_US |
| dc.subject |
Planar graph |
en_US |
| dc.subject |
Rectangularly dualizable graphs |
en_US |
| dc.subject |
Rectangular partitions |
en_US |
| dc.subject |
Rectangular duals |
en_US |
| dc.title |
On the characterization of rectangular duals |
en_US |
| dc.type |
Article |
en_US |