Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11294| Title: | Transformations among rectangular partitions |
| Authors: | Shekhawat, Krishnendra |
| Keywords: | Mathematics Planar graph Rectangular duals Rectangular partitions Rectangularly dualizable graphs |
| Issue Date: | 2022 |
| Publisher: | TOC |
| 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. |
| URI: | https://toc.ui.ac.ir/article_26808.html http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11294 |
| 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.