اخبار و اعلانات
آمار
| تعداد نشریات | 43 |
| تعداد شماره‌ها | 1,398 |
| تعداد مقالات | 11,518 |
| تعداد مشاهده مقاله | 19,138,443 |
| تعداد دریافت فایل اصل مقاله | 9,121,738 |
Transformations among rectangular partitions | ||
| Transactions on Combinatorics | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 12 مرداد 1401 اصل مقاله (489.38 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22108/toc.2022.133242.1984 | ||
| نویسنده | ||
Vinod Kumar  
| ||
| Department of Mathematics, Birla Institute of Technology and Science, Pilani, Rajasthan-333031 | ||
| چکیده | ||
| 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 RDG. | ||
| کلیدواژه‌ها | ||
| planar graph؛ rectangular dual؛ rectangularly dualizable graph؛ Rectangular Partitions | ||
|
آمار تعداد مشاهده مقاله: 6 |
||
