Title of article
Transformations among rectangular partitions
Author/Authors
Kumar ، Vinod Department of Mathematics - Birla Institute of Technology and Science - Pilani Campus , Shekhawat ، Krishnendra Department of Mathematics - Birla Institute of Technology and Science - Pilani Campus
From page
143
To page
163
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.
Keywords
planar graph , rectangular dual , rectangularly dualizable graph , Rectangular Partitions
Journal title
Transactions on Combinatorics
Journal title
Transactions on Combinatorics
Record number
2737684
Link To Document