In this article, we have proven that for every Planar graph on 3-connect with total heights. The number of lines and the number ofPage by page, level 6, n-step at most n + 2.2. in the case where n is the number of pairs, and is step levels page.n + 12. in the case where n is an odd number of.
การแปล กรุณารอสักครู่..
