Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/11294Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Shekhawat, Krishnendra | - |
| dc.date.accessioned | 2023-08-10T10:14:24Z | - |
| dc.date.available | 2023-08-10T10:14:24Z | - |
| dc.date.issued | 2022 | - |
| dc.identifier.uri | https://toc.ui.ac.ir/article_26808.html | - |
| dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11294 | - |
| dc.description.abstract | We first prove that there always exists a maximal rectangularly dualizable graph for a given rectangularly dualizable graph and present an algorithm for its construction. Further, we show that a maximal rectangularly dualizable graph can always be transformed to an edge-irreducible rectangularly dualizable graph and present an algorithm that transforms a maximal rectangularly dualizable graph to an edge-irreducible rectangularly dualizable graph. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | TOC | en_US |
| dc.subject | Mathematics | en_US |
| dc.subject | Planar graph | en_US |
| dc.subject | Rectangular duals | en_US |
| dc.subject | Rectangular partitions | en_US |
| dc.subject | Rectangularly dualizable graphs | en_US |
| dc.title | Transformations among rectangular partitions | en_US |
| dc.type | Article | en_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.