Transformations among rectangular partitions
| Autor: | Vinod Kumar, Krishnendra Shekhawat |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2023 |
| Předmět: | |
| Zdroj: | Transactions on Combinatorics, Vol 12, Iss 3, Pp 143-163 (2023) |
| Druh dokumentu: | article |
| ISSN: | 2251-8657 2251-8665 |
| DOI: | 10.22108/toc.2022.133242.1984 |
| Popis: | 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. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|