%0 Journal Article
%T Transformations among rectangular partitions
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Kumar, Vinod
%A Shekhawat, Krishnendra
%D 2023
%\ 09/01/2023
%V 12
%N 3
%P 143-163
%! Transformations among rectangular partitions
%K planar graph
%K rectangular dual
%K rectangularly dualizable graph
%K Rectangular Partitions
%R 10.22108/toc.2022.133242.1984
%X 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.
%U https://toc.ui.ac.ir/article_26808_c7fc0941f103f715082931044c68cdd4.pdf