Transformations among rectangular partitions
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 dua...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2023-09-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | https://toc.ui.ac.ir/article_26808_fbd1431a1ea5c85b2a6c397dacefc696.pdf |