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...
| Prif Awduron: | , |
|---|---|
| Fformat: | Erthygl |
| Iaith: | English |
| Cyhoeddwyd: |
University of Isfahan
2023-09-01
|
| Cyfres: | Transactions on Combinatorics |
| Pynciau: | |
| Mynediad Ar-lein: | https://toc.ui.ac.ir/article_26808_fbd1431a1ea5c85b2a6c397dacefc696.pdf |
| Crynodeb: | 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. |
|---|---|
| ISSN: | 2251-8657 2251-8665 |