DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/14950
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShekhawat, Krishnendra-
dc.date.accessioned2024-05-21T03:59:00Z-
dc.date.available2024-05-21T03:59:00Z-
dc.date.issued2024-
dc.identifier.urihttps://nntdm.net/volume-30-2024/number-1/141-149/-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14950-
dc.description.abstractA 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.isoenen_US
dc.publisherNNTDMen_US
dc.subjectMathematicsen_US
dc.subjectPlanar graphen_US
dc.subjectRectangularly dualizable graphsen_US
dc.subjectRectangular partitionsen_US
dc.subjectRectangular dualsen_US
dc.titleOn the characterization of rectangular dualsen_US
dc.typeArticleen_US
Appears in Collections:Department of Mathematics

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.