Transformations among rectangular partitions
نویسندگان
1 Department of Mathematics, Birla Institute of Technology and Science, Pilani, Pilani Campus, Rajasthan-333031, India
2 Department of Mathematics, Birla Institute of Technology and Science, Pilani, Pilani Campus, Rajasthan-333031, India
doi
10.22108/toc.2022.133242.1984چکیده
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.
