TY - JOUR
ID - 26808
TI - Transformations among rectangular partitions
JO - Transactions on Combinatorics
JA - TOC
LA - en
SN - 2251-8657
AU - Kumar, Vinod
AU - Shekhawat, Krishnendra
AD - Department of Mathematics, Birla Institute of Technology and Science, Pilani, Pilani Campus, Rajasthan-333031, India
Y1 - 2023
PY - 2023
VL - 12
IS - 3
SP - 143
EP - 163
KW - planar graph
KW - rectangular dual
KW - rectangularly dualizable graph
KW - Rectangular Partitions
DO - 10.22108/toc.2022.133242.1984
N2 - 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.
UR - https://toc.ui.ac.ir/article_26808.html
L1 - https://toc.ui.ac.ir/article_26808_c7fc0941f103f715082931044c68cdd4.pdf
ER -