|
|
|
|
transformations among rectangular partitions
|
|
|
|
|
|
|
|
نویسنده
|
shekhawat krishnendra ,kumar vinod
|
|
منبع
|
transactions on combinatorics - 2023 - دوره : 12 - شماره : 3 - صفحه:143 -163
|
|
چکیده
|
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.
|
|
کلیدواژه
|
planar graph ,rectangular dual ,rectangularly dualizable graph ,rectangular partitions
|
|
آدرس
|
pilani campus, birla institute of technology and science, department of mathematics, india, pilani campus, birla institute of technology and science, department of mathematics, india
|
|
پست الکترونیکی
|
vinodchahar04@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|