On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area

Size: px
Start display at page:

Download "On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area"

Transcription

1 Journl of Grph Algorithms n Applitions vol. 13, no. 2, pp (2009) On Clss of Plnr Grphs with Stright-Line Gri Drwings on Liner Are M. Rezul Krim 1,2 M. Siur Rhmn 1 1 Deprtment of Computer Siene n Engineering, Bnglesh University of Engineering n Tehnology (BUET), Dhk-1000, Bnglesh. 2 Deprtment of Computer Siene n Engineering, University of Dhk, Dhk-1000, Bnglesh. Astrt A stright-line gri rwing of plnr grph G is rwing of G on n integer gri suh tht eh vertex is rwn s gri point n eh ege is rwn s stright-line segment without ege rossings. It is well known tht plnr grph of n verties mits stright-line gri rwing on gri of re O(n 2 ). A lower oun of Ω(n 2 ) on the re-requirement for stright-line gri rwings of ertin plnr grphs re lso known. In this pper, we introue firly lrge lss of plnr grphs whih mits stright-line gri rwing on gri of re O(n). We give linertime lgorithm to fin suh rwing. Our new lss of plnr grphs, whih we ll oughnut grphs, is sulss of 5-onnete plnr grphs. We show severl interesting properties of oughnut grphs in this pper. One n esily oserve tht ny spnning sugrph of oughnut grph lso mits stright-line gri rwing with liner re. But the reognition of spnning sugrph of oughnut grph seems to e non-trivil prolem, sine the reognition of spnning sugrph of given grph is n NP-omplete prolem in generl. We estlish neessry n suffiient onition for 4-onnete plnr grph G to e spnning sugrph of oughnut grph. We lso give liner-time lgorithm to ugment 4-onnete plnr grph G to oughnut grph if G stisfies the neessry n suffiient onition. Sumitte: April 2008 Artile type: Regulr pper Reviewe: Jnury 2009 Finl: April 2009 Revise: Ferury 2009 Aepte: April 2009 Pulishe: June 2009 Communite y: Petr Mutzel E-mil resses: rkrim@univhk.eu (M. Rezul Krim) siurrhmn@se.uet.. (M. Siur Rhmn)

2 154 Krim n Rhmn Stright-Line Gri Drwings on Liner Are 1 Introution Reently utomti estheti rwings of grphs hve rete intense interest ue to their ro pplitions in omputer networks, VLSI lyout, informtion visuliztion et., n s onsequene numer of rwing styles hve ome out [4, 11, 14, 16]. A lssil n wiely stuie rwing style is the strightline rwing of plnr grph. A stright-line rwing of plnr grph G is rwing of G suh tht eh vertex is rwn s point n eh ege is rwn s stright-line segment without ege rossings. A stright-line gri rwing of plnr grph G is stright-line rwing of G on n integer gri suh tht eh vertex is rwn s gri point s shown in Figure 1(). h F 1 h j i p l k o g () F 2 m e n f f g i o n e j p m () k l F1 f g n h e m F 2 o i f g h i l p k () j e n o m p l () k j Figure 1: () A plnr grph G, () stright-line gri rwing of G with re O(n 2 ), () oughnut emeing of G n () stright-line gri rwing of G with re O(n). Wgner [19], Fry [6] n Stein [18] inepenently prove tht every plnr grph G hs stright-line rwing. Their proofs immeitely yiel polynomil-

3 JGAA, 13(2) (2009) 155 time lgorithms to fin stright-line rwing of given plne grph. However, the re of retngle enlosing rwing on n integer gri otine y these lgorithms is not oune y ny polynomil of the numer n of verties in G. In ft, to otin rwing of re oune y polynomil remine s n open prolem for long time. In 1990, e Frysseix et l. [3] n Shnyer [17] showe y two ifferent methos tht every plnr grph of n 3 verties hs strightline rwing on n integer gri of size (2n 4) (n 2) n (n 2) (n 2), respetively. Figure 1() illustrtes stright-line gri rwing of the grph G in Figure 1() with re O(n 2 ). A nturl question rises: wht is the minimum size of gri require for stright-line rwing? e Frysseix et l. showe tht, for eh n 3, there exists plne grph of n verties, for exmple neste tringles, whih nees gri size of t lest 2(n 1)/3 2(n 1)/3 for ny gri rwing [2, 3]. Reently Frti n Ptrignni showe tht n 2 /9 + Ω(n) re is neessry for ny plnr stright-line rwing of neste tringles grph [7]. (Note tht plne grph is plnr grph with given emeing.) It hs een onjeture tht every plne grph of n verties hs gri rwing on 2n/3 2n/3 gri, ut it is still n open prolem. For some restrite lsses of grphs, more ompt stright-line gri rwings re known. For exmple, 4-onnete plne grph G hving t lest four verties on the outer fe hs stright-line gri rwing with re ( n/2 1) ( n/2 ) [15]. Grg n Rusu showe tht n n-noe inry tree hs plnr stright-line gri rwing with re O(n) [9]. Although trees mit stright-line gri rwings with liner re, it is generlly thought tht tringultions my require gri of qurti size. Hene fining nontrivil lsses of plnr grphs of n verties riher thn trees tht mit stright-line gri rwings with re o(n 2 ) is poste s n open prolem in [1]. Grg n Rusu showe tht n outerplnr grph with n verties n mximum egree hs plnr stright-line rwing with re O(n 1.48 ) [10]. Reently Di Bttist n Frti showe tht lne outerplnr grph of n verties hs stright-line gri rwing with re O(n) n generl outerplnr grph of n verties hs stright-line gri rwing with re O(n 1.48 ) [5]. In this pper, we introue new lss of plnr grphs whih hs strightline gri rwing on gri of re O(n). We give liner-time lgorithm to fin suh rwing. Our new lss of plnr grphs is sulss of 5-onnete plnr grphs, n we ll the lss oughnut grphs sine grph in this lss hs oughnut-like emeing s illustrte in Figure 1(). In n emeing of oughnut grph of n verties, there re two vertex-isjoint fes eh hving extly n/4 verties n eh of ll the other fes hs extly three verties. Figure 1() illustrtes oughnut grph of 16 verties where eh of the two fes F 1 n F 2 ontins four verties n eh of ll other fes ontins extly three verties. Figure 1() illustrtes oughnut-like emeing of G where F 1 is emee s the outer fe n F 2 is emee s n inner fe. A stright-line gri rwing of G with re O(n) is illustrte in Figure 1(). The outerplnrity of oughnut grph is 3. Thus oughnut grphs introue sulss of 3-outerplnr grphs tht mits stright-line gri rwing with liner re. One n esily oserve tht ny spnning sugrph of ough-

4 156 Krim n Rhmn Stright-Line Gri Drwings on Liner Are nut grph lso mits stright-line gri rwing with liner re. But the reognition of spnning sugrph of given grph is n NP-omplete prolem in generl. We estlish neessry n suffiient onition for 4-onnete plnr grph to e spnning sugrph of oughnut grph. We lso provie liner-time lgorithm to ugment 4-onnete grph G to oughnut grph if G stisfies the neessry n suffiient onition. This gives us new lss of grphs whih is sulss of 4-onnete plnr grphs tht mits stright-line gri rwings with liner re. The reminer of the pper is orgnize s follows. In Setion 2, we give some efinitions. Setion 3 provies some properties of the lss of oughnut grphs. Setion 4 els with stright-line gri rwings of oughnut grphs. Setion 5 provies the hrteriztion for 4-onnete plnr grph to e spnning sugrph of oughnut grph. Finlly Setion 6 onlues the pper. Erly versions of this pper hve een presente t [12] n [13]. 2 Preliminries In this setion we give some efinitions. Let G = (V, E) e onnete simple grph with vertex set V n ege set E. Throughout the pper, we enote y n the numer of verties in G, tht is, n = V, n enote y m the numer of eges in G, tht is, m= E. An ege joining verties u n v is enote y (u, v). The egree of vertex v, enote y (v), is the numer of eges inient to v in G. G is lle r-regulr if every vertex of G hs egree r. We ll vertex v neighor of vertex u in G if G hs n ege (u, v). The onnetivity κ(g) of grph G is the minimum numer of verties whose removl results in isonnete grph or single-vertex grph K 1. G is lle k-onnete if κ(g) k. We ll vertex of G ut-vertex of G if its removl results in isonnete or single-vertex grph. For W V, we enote y G W the grph otine from G y eleting ll verties in W n ll eges inient to them. A ut-set of G is set S V (G) suh tht G S hs more thn one omponent or G S is single vertex grph. A pth in G is n orere list of istint verties v 1, v 2,..., v q V suh tht (v i 1, v i ) E for ll 2 i q. Verties v 1 n v q re en-verties of the pth v 1, v 2,..., v q. Two pths re vertex-isjoint if they o not shre ny ommon vertex exept their en verties. The length of pth is the numer of eges on the pth. We ll pth P n even pth if the numer of eges on P is even. We ll pth P n o pth if the numer of eges on P is o. A grph is plnr if it n e emee in the plne so tht no two eges interset geometrilly exept t vertex to whih they re oth inient. A plne grph is plnr grph with fixe emeing. A plne grph G ivies the plne into onnete regions lle f es. A oune region is lle n inner fe n the unoune region is lle the outer fe. For fe F in G we enote y V (F ) the set of verties of G on the ounry of fe F. Two fes F 1 n F 2 re vertex-isjoint if V (F 1 ) V (F 2 ) =. Let F e fe in plne grph G with n 3. If the ounry of F hs extly three verties

5 JGAA, 13(2) (2009) 157 then we ll F tringulte fe. One n ivie fe F of p (p 3) verties into p 2 tringulte fes y ing p 3 extr eges. The opertion ove is lle tringulting fe. If every fe of grph is tringulte, then the grph is lle tringulte plne grph. We n otin tringulte plne grph G from non-tringulte plne grph G y tringulting ll fes of G. A mximl plnr grph is one to whih no ege n e e without losing plnrity. Thus the ounry of every fe of G is tringle in ny emeing of mximl plnr grph G with n 3, n hene n emeing of mximl plnr grph is often lle tringulte plne grph. It n e erive from Euler s formul for plnr grphs tht if G is mximl plnr grph with n verties n m eges then m = 3n 6, for more etils see [16]. We ll fe qurngle fe if the fe hs extly four verties. For ny 3-onnete plnr grph the following ft hols. Ft 1 Let G e 3-onnete plnr grph n let Γ n Γ e ny two plnr emeings of G. Then ny fil yle of Γ is fil yle of Γ n vie vers. Let G e 5-onnete plnr grph, let Γ e ny plnr emeing of G n let p e n integer suh tht p 4. We ll G p-oughnut grph if the following onitions ( 1 ) n ( 2 ) hol: ( 1 ) Γ hs two vertex-isjoint fes eh of whih hs extly p verties, n ll the other fes of Γ hs extly three verties; n ( 2 ) G hs the minimum numer of verties stisfying onition ( 1 ). In generl, we ll p-oughnut grph for p 4 oughnut grph. Sine oughnut grph is 5-onnete plnr grph, Ft 1 implies tht the eomposition of oughnut grph into its fil yles is unique. Throughout the pper we often mention fes of oughnut grph G without mentioning its plnr emeing where the esription of the fes is vli for ny plnr emeing of G. 3 Properties of Doughnut Grphs In this setion we will show some properties of p-oughnut grph. We hve the following lemm on the numer of verties of grph stisfying onition ( 1 ). Lemm 2 Let G e 5-onnete plnr grph, let Γ e ny plnr emeing of G, n let p e n integer suh tht p 4. Assume tht Γ hs two vertexisjoint fes eh of whih hs extly p verties, n ll the other fes of Γ hs extly three verties. Then G hs t lest 4p verties. Proof: Let F 1 n F 2 e the two fes of Γ eh of whih ontins extly p verties. Let x e the numer of verties in G whih re neither on F 1 nor on F 2. Then G hs x + 2p verties.

6 158 Krim n Rhmn Stright-Line Gri Drwings on Liner Are We lulte the numer of eges in G s follows. Fes F 1 n F 2 of Γ re not tringulte sine p 4. If we tringulte F 1 n F 2 of Γ then the resulting grph G is mximl plnr grph. Using Euler s formul, G hs extly 3(x + 2p) 6 = 3x + 6p 6 eges. To tringulte eh of F 1 n F 2, we nee to p 3 eges n hene the numer of eges in G is extly (3x + 6p 6) 2(p 3) = 3x + 4p. (1) Sine G is 5-onnete, using the egree-sum formul, we get 2(3x + 4p) 5(x + 2p). This reltion implies x 2p. (2) Therefore G hs t lest 4p verties. Lemm 2 implies tht p-oughnut grph hs 4p or more verties. We now show tht 4p verties re suffiient to onstrut p-oughnut grph s in the following lemm. Lemm 3 For n integer p, p 4, one n onstrut p-oughnut grph G with 4p verties. To prove Lemm 3 we first onstrut plnr emeing Γ of G with 4p verties y the onstrution Construt-Doughnut given elow n then show tht G is p-oughnut grph. Construt-Doughnut. Let C 1, C 2, C 3 e three vertex-isjoint yles suh tht C 1 ontins p verties, C 2 ontins 2p verties n C 3 ontins p verties. Let x 1, x 2,..., x p e the verties on C 1, y 1, y 2,..., y p e the verties on C 3, n z 1, z 2,.., z 2p e the verties on C 2. Let R 1, R 2 n R 3 e three onentri irles on plne with rius r 1, r 2 n r 3, respetively, suh tht r 1 > r 2 > r 3. We eme C 1, C 2 n C 3 on R 1, R 2 n R 3 respetively, s follows. We put the verties x 1, x 2...x p of C 1 on R 1 in lokwise orer suh tht x 1 is put on the leftmost position mong the verties x 1, x 2,..., x p. Similrly, we put verties z 1, z 2,..., z 2p of C 2 on R 2 n y 1, y 2,..., y p of C 3 on R 3. We eges etween the verties on C 1 n C 2, n etween the verties on C 2 n C 3 s follows. We hve two ses to onsier. Cse 1: k is even in z k. In this se, we two eges (z k, x k/2 ), (z k, x i ) etween C 2 n C 1, n one ege (z k, y i ) etween C 2 n C 3 where i = 1 if k = 2p, n i = k/2 + 1 otherwise. Cse 2: k is o in z k. In this se, we two eges (z k, y k/2 ), (z k, y i ) etween C 2 n C 3, n one ege (z k, x k/2 ) etween C 1 n C 2 where i = 1 if k = 2p 1, n i = k/2 + 1 otherwise. We thus onstrute plnr emeing Γ of G. Figure 2 illustrtes the onstrution ove for the se of p = 4. We hve the following lemm on the onstrution Construt-Doughnut.

7 JGAA, 13(2) (2009) 159 x z 1 1 z 8 y 1 x4 z z6 y 4 3 z y 5 3 x3 x 1 x4 1 z7 z 8 2 z6 y 4 3 z 1 z y 1 y 5 3 x3 x 1 z 1 x4 1 z7 z 8 2 z6 y 4 3 z y 1 y 5 3 x3 z 2 y2 z3 x2 () z4 z 2 y2 z 3 x2 () z 4 z 2 y2 z 3 x2 () z 4 Figure 2: Illustrtion for the onstrution of plnr emeing Γ of p- oughnut grph G for p = 4; () emeing of the three yles C 1, C 2 n C 3 on three onentri irles, () ition of eges for the se where k is even in z k n () Γ. Lemm 4 Let Γ e the plne grph of 4p verties otine y the onstrution Construt-Doughnut. Then Γ hs extly two vertex-isjoint fes F 1 n F 2 eh of whih hs extly p verties, n the rest of the fes re tringulte. Proof: The onstrution of Γ implies tht yle C 1 is the ounry of the outer fe F 1 of Γ n yle C 3 is the ounry of n inner fe F 2. Eh of F 1 n F 2 hs extly p verties. Clerly the two fes F 1 n F 2 of Γ re vertex-isjoint. Thus it is remine to show tht the rest of the fes of Γ re tringulte. The rest of the fes n e ivie into two groups; (i) fes hving verties on oth the yles C 1 n C 2, n (ii) fes hving the verties on oth the yles C 2 n C 3. We only prove tht eh fe in group (i) is tringulte, sine the proof for group (ii) is similr. From our onstrution eh vertex z i with even i hs extly two neighors on C 1, n the two neighors of z i on C 1 re onseutive. Hene we get tringulte fe for eh z i with even i whih ontins z i n the two neighors of z i on C 1. We now show tht the remining fes in group (i) re tringulte. Clerly eh of the remining fes in group (i) must ontin vertex z i with o i sine vertex on fe in group (i) is either on C 1 or on C 2 n vertex on C 2 hs t most two neighors on C 1. Let z i, z i+1 n z i+2 e three onseutive verties on C 2 with even i. Then z i n z i+2 hs ommon neighor x on C 1. One n oserve from our onstrution tht x is lso the only neighor of z i+1 on C 1. Then extly two fes in group (i) ontin z i+1 n the two fes re tringulte. This implies tht for eh z i on C 2 with o i there re extly two fes in group (i) whih ontin z i, n the two fes re tringulte.

8 160 Krim n Rhmn Stright-Line Gri Drwings on Liner Are We re rey to prove Lemm 3. Proof of Lemm 3 We onstrut plnr emeing Γ of grph G with 4p verties y the onstrution Construt-Doughnut n show tht G is p-oughnut grph. To prove this lim we nee to prove tht G stisfies the following properties () (): () the grph G is 5-onnete plnr grph; () ny plnr emeing Γ of G hs extly two vertex-isjoint fes eh of whih hs extly p verties, n ll the other fes re tringulte; n () G hs the minimum numer of verties stisfying () n (). () G is plnr grph sine it hs plnr emeing Γ s illustrte in Figure 2(). To prove tht G is 5-onnete, we show tht the size of ny ut-set of G is 5 or more. We first show tht G is 5-regulr. From the onstrution, one n esily see tht eh of the vertex of C 2 hs extly three neighors in V (C 1 ) V (C 3 ). Hene the egree of eh vertex of C 2 is extly 5. We only prove tht the egree of eh vertex of C 1 is extly 5 sine the proof is similr for the verties of C 3. Eh even inex vertex v of C 2 hs two neighors on C 1 n the two neighors of v re onseutive on C 1 y onstrution. Eh vertex u of C 1 hs t most two even inex neighors on C 2, sine C 2 hs p even inex verties, C 1 hs p verties, n Γ is plnr emeing. Assume tht vertex u of C 1 hs two even inex neighors y i n y i+2 on C 2. Sine Γ is plnr emeing y i+1 n hve only one neighor on C 1 whih is u. Thus vertex u on C 1 hs t most three neighors on C 2. Sine there re extly 3p eges eh of whih hs one en point on C 1 n the other on C 2, n vertex on C 1 hs t most three neighors on C 2, eh vertex of C 1 hs extly three neighors on C 2. Hene the egree of vertex on C 1 is 5. Therefore G is 5-regulr. We next show tht the size of ny ut-set of G is 5 or more. Assume for ontrition tht G hs ut-set of less thn five verties. In suh se, G woul hve vertex of egree less thn five, ontrition. (Note tht G is 5-regulr, the verties of G lie on three vertex isjoint yles C 1, C 2 n C 3, none of the verties of C 1 hs neighor on C 3, eh of the fes of G is tringulte exept fes F 1 n F 2.) () By Lemm 4, G hs plnr emeing Γ suh tht Γ hs extly two vertex-isjoint fes F 1 n F 2 eh of whih hs extly p verties, n the rest of the fes re tringulte. Sine G is 5-onnete, Ft 1 implies tht ny plnr emeing Γ of G hs extly two vertex-isjoint fes eh of whih hs extly p verties, n ll the other fes re tringulte. () We hve onstrute the grph G with 4p verties n proofs for () n () imply tht G stisfies properties () n (). G is 5-onnete plnr grph n hene stisfies onition ( 1 ) of the efinition of p-oughnut grph. By Lemm 2, 4p is the minimum numer of verties of suh grph.

9 JGAA, 13(2) (2009) 161 Conition ( 2 ) of the efinition of p-oughnut grph n Lemms 2 n 3 imply tht p-oughnut grph G hs extly 4p verties. Then the vlue of x in Eq. (2) is 2p in G. By Eq. (1), G hs extly 3x + 4p = 10p eges. Sine G is 5-onnete, every vertex hs egree 5 or more. Then the egree-sum formul implies tht every vertex of G hs egree extly 5. Thus the following theorem hols. Theorem 1 Let G e p-oughnut grph. Then G is 5-regulr n hs extly 4p verties. For yle C in plne grph G, we enote y G(C) the plne sugrph of G insie C exluing C. Let C 1, C 2 n C 3 e three vertex-isjoint yles in plnr grph G suh tht V (C 1 ) V (C 2 ) V (C 3 )=V (G). Then we ll plnr emeing Γ of G oughnut emeing of G if C 1 is the outer fe n C 3 is n inner fe of Γ, G(C 1 ) ontins C 2 n G(C 2 ) ontins C 3. We ll C 1 the outer yle, C 2 the mile yle n C 3 the inner yle of Γ. We next show tht p-oughnut grph hs oughnut emeing. To prove the lim we nee the following lemms. Lemm 5 Let G e p-oughnut grph. Let F 1 n F 2 e the two fes of G eh of whih ontins extly p verties. Then G {V (F 1 ) V (F 2 )} is onnete n ontins yle. Proof: Sine G is 5-onnete, G = G {V (F 1 ) V (F 2 )} is onnete; otherwise, G woul hve ut-set of 4 verties - two of them re on F 1 n the other two re on F 2, ontrition. Clerly G hs extly 2p verties. Sine G is 5-regulr n hs extly 4p verties y Theorem 1, one n oserve following the egree-sum formul tht G ontins t lest 2p eges; if there is no ege etween vertex of F 1 n vertex of F 2 in G then G ontins extly 2p eges, otherwise G ontins more thn 2p eges. Sine G is onnete, hs 2p verties n hs t lest 2p eges, G must hve yle. Lemm 6 Let G e p-oughnut grph. Let F 1 n F 2 e the two fes of G eh of whih ontins extly p verties. Let Γ e plnr emeing of G suh tht F 1 is emee s the outer fe. Let C e yle in G {V (F 1 ) V (F 2 )}. Then G(C) in Γ ontins F 2. Proof: Assume tht G(C) oes not ontin F 2 in Γ. Sine F 1 is emee s the outer fe of Γ, F 2 will e n inner fe of Γ s illustrte in Figure 3. Then there woul e ege rossings in Γ mong the eges from the verties on C to the verties on F 1 n F 2 s illustrte in Figure 3, ontrition to the ssumption tht Γ is plnr emeing of G. (Note tht G is 5-onnete, 5-regulr n hs 10p eges.) Therefore G(C) ontins F 2. Lemm 7 Let G e p-oughnut grph. Let F 1 n F 2 e the two fes of G eh of whih ontins extly p verties. Then the following () - () hol. () There is no ege etween vertex of F 1 n vertex of F 2.

10 162 Krim n Rhmn Stright-Line Gri Drwings on Liner Are F 1 C F 2 Figure 3: An emeing Γ of G where F 1 is emee s the outer fe n G(C ) oes not ontin F 2. () G {V (F 1 ) V (F 2 )} ontins extly 2p eges n hs extly one yle. () All the verties of G {V (F 1 ) V (F 2 )} re ontine in single yle. Proof: () Let Γ e plnr emeing of G suh tht F 1 is emee s the outer fe. Let C e yle in G {V (F 1 ) V (F 2 )}. Sine G(C) ontins F 2 y Lemm 6, there is no ege etween vertex of F 1 n vertex of F 2 ; otherwise, n ege etween vertex of F 1 n vertex of F 2 woul ross n ege on C, ontrition to the ssumption tht Γ is plnr emeing of G. () Sine there is no ege etween vertex of F 1 n vertex of F 2 y Lemm 7(), G {V (F 1 ) V (F 2 )} ontins extly 2p eges s mentione in the proof of Lemm 5. Sine G {V (F 1 ) V (F 2 )} is onnete, ontins extly 2p verties n hs extly 2p eges, G {V (F 1 ) V (F 2 )} ontins extly one yle. () Let Γ e plnr emeing of G suh tht F 1 is emee s the outer fe. Let C e yle in G {V (F 1 ) V (F 2 )}. By Lemm 7(), C is the only yle in G {V (F 1 ) V (F 2 )}. Assume tht the yle C oes not ontin ll the verties of G {V (F 1 ) V (F 2 )}. Then there is t lest vertex in G {V (F 1 ) V (F 2 )} whose egree is one in G {V (F 1 ) V (F 2 )}. Let v e vertex of egree one in G {V (F 1 ) V (F 2 )}. We my ssume tht the vertex v is outsie of the yle C in Γ sine the proof is similr if v is insie of the yle C. Then the four neighors of v must e on F 1, sine G {V (F 1 ) V (F 2 )} ontins extly one yle y Lemm 7(), the vertex v is outsie of the yle C, n G(C) ontins F 2 y Lemm 6. Then either G woul not e 5-regulr or Γ woul not e plnr emeing of G, ontrition. Hene ll the verties of G {V (F 1 ) V (F 2 )} re ontine in yle C. We now prove the following theorem. Theorem 2 A p-oughnut grph lwys hs oughnut emeing.

11 JGAA, 13(2) (2009) 163 Proof: Let F 1 n F 2 e two fes of G eh of whih ontins extly p verties. Let Γ e plnr emeing of G suh tht F 1 is emee s the outer fe. By Lemm 7(), ll the verties of G {V (F 1 ) V (F 2 )} re ontine in single yle C. By Lemm 6, G(C) ontins F 2. Then in Γ, G(F 1 ) ontins C n G(C) ontins F 2, n hene Γ is oughnut emeing. A 1-outerplnr grph is n emee plnr grph where ll verties re on the outer fe. It is lso lle 1-outerplne grph. An emee grph is k-outerplne (k > 1) if the emee grph otine y removing ll verties of the outer fe is (k 1)-outerplne grph. A grph is k-outerplnr if it mits k-outerplnr emeing. A plnr grph G hs outerplnrity k (k > 0) if it is k-outerplnr n it is not j-outerplnr for 0 < j < k. In the rest of this setion, we show tht the outerplnrity of p-oughnut grph G is 3. Sine none of the fes of G ontins ll verties of G, G oes not mit 1-outerplnr emeing. We thus nee to show tht G oes not mit 2-outerplnr emeing. We hve the following ft. Ft 8 A grph G hving outerplnrity 2 hs ut-set of four or less verties. Proof: Deletion of ll verties on the outer fe from 2-outerplne grph leves 1-outerplne grph. Sine ll verties of 1-outerplne grph re on the outer fe, 1-outerplne grph hs ut-set of t most two verties. Then one n oserve tht grph G hving outerplnrity 2 hs ut-set of four or less verties. Sine G is 5-onnete grph, G hs no ut-set of four or less verties. Hene y Ft 8 the grph G hs outerplnrity greter thn 2. Thus the following lemm hols. Lemm 9 Let G e p-oughnut grph for p 4. Then G is neither 1- outerplnr grph nor 2-outerplnr grph. We now prove the following theorem. Theorem 3 The outerplnrity of p-oughnut grph G is 3. Proof: A oughnut emeing of G immeitely implies tht G hs 3- outerplnr emeing. By Lemm 9, G is neither 1-outerplnr grph nor 2-outerplnr grph. Therefore the outerplnrity of p-oughnut grph is 3. 4 Drwings of Doughnut Grphs In this setion we give liner-time lgorithm for fining stright-line gri rwing of oughnut grph on gri of liner re. Let G e p-oughnut grph. Then G hs oughnut emeing y Theorem 2. Let Γ e oughnut emeing of G s illustrte in Figure 4(). Let C 1, C 2 n C 3 e the outer yle, the mile yle n the inner yle of Γ, respetively. We hve the following fts.

12 164 Krim n Rhmn Stright-Line Gri Drwings on Liner Are Ft 10 Let G e p-oughnut grph n let Γ e oughnut emeing of G. Let C 1, C 2 n C 3 e the outer yle, the mile yle n the inner yle of Γ, respetively. For ny two onseutive verties z i, z i+1 on C 2, one of z i, z i+1 hs extly one neighor on C 1 n the other hs extly two neighors on C 1. Ft 11 Let G e p-oughnut grph n let Γ e oughnut emeing of G. Let C 1, C 2 n C 3 e the outer yle, the mile yle n the inner yle of Γ, respetively. Let z i e vertex of C 2, then either the following () or () hols. () z i hs extly one neighor on C 1 n extly two neighors on C 3. () z i hs extly one neighor on C 3 n extly two neighors on C 1. Before esriing our lgorithm we nee some efinitions. Let z i e vertex of C 2 suh tht z i hs two neighors on C 1. Let x n x e the two neighors of z i on C 1 suh tht x is the ounter lokwise next vertex to x on C 1. We ll x the left neighor of z i on C 1 n x the right neighor of z i on C 1. Similrly we efine the left neighor n the right neighor of z i on C 3 if vertex z i on C 2 hs two neighors on C 3. We re now rey to esrie our lgorithm. We eme C 1, C 2 n C 3 on three neste retngles R 1, R 2 n R 3, respetively on gri s illustrte in Figure 4(). We rw retngle R 1 on gri with four orners on gri point (0, 0), (p + 1, 0), (p + 1, 5) n (0, 5). Similrly the four orners of R 2 re (1, 1), (p, 1), (p, 4), (1, 4) n the four orners of R 3 re (2, 2), (p 1, 2), (p 1, 3), (2, 3). We first eme C 2 on R 2 s follows. Let z 1, z 2,..., z 2p e the verties on C 2 in ounter lokwise orer suh tht z 1 hs extly one neighor on C 1. We put z 1 on (1, 1), z p on (p, 1), z p+1 on (p, 4) n z 2p on (1, 4). We put the other verties of C 2 on gri points of R 2 preserving the reltive positions of verties of C 2. We next put verties of C 1 on R 1 s follows. Let x 1 e the neighor of z 1 on C 1 n let x 1, x 2,..., x p e the verties of C 1 in ounter lokwise orer. We put x 1 on (0, 0) n x p on (0, 5). Sine z 1 hs extly one neighor on C 1, y Ft 10, z 2p hs extly two neighors on C 1. Sine z 1 n z 2p re on tringulte fe of G hving verties on oth C 1 n C 2, x 1 is neighor of z 2p. One n esily oserve tht x p is the other neighor of z 2p on C 1. Clerly the eges (x 1, z 1 ), (x 1, z 2p ), (x p, z 2p ) n e rwn s stright-line segments without ege rossings s illustrte in Figure 4(). We next put neighors of z p n z p+1. Let x i e the neighor of z p on C 1 if z p hs extly one neighor on C 1, otherwise let x i e the left neighor of z p on C 1. We put x i on (p+1, 0) n x i+1 on (p+1, 5). In se of z p hs extly one neighor on C 1, y Ft 10, z p+1 hs two neighors on C 1, n x i n x i+1 re the two neighors of z p+1 on C 1. Clerly the eges (z p, x i ), (z p+1, x i ) n (z p+1, x i+1 ) n e rwn s strightline segments without ege rossings, s illustrte in Figure 4(). In se of z p hs extly two neighors x i n x i+1 on C 1, the eges etween neighors of z p n z p+1 on C 1 n e rwn without ege rossings s illustrte in Figure 5. We put the other verties of C 1 on gri points of R 1 ritrrily preserving their reltive positions on C 1.

13 JGAA, 13(2) (2009) 165 C 1 x p C 2 z 2 p y p C 3 x p R 1 (0,5) ( p+1,5) x i+1 R2 z 2 p z (1,4) ( p,4) p+1 (2,3) (2,2) R 3 x1 z1 (p 1,3) (p 1,2) z2 y 1 z3 x2 y2 y3 z4 () x p z5 z 2 p x3 z p (0,5) ( p+1,5) (1,4) (2,3) (2,2) (p 1,3) (p 1,2) p,4) ( z p+1 x i+1 z 1 (1,1) ( p,1) z p z 1 (1,1) ( p,1) z p x 1 x p x i x 1 (0,0) ( p+1,0) (0,0) () (0,5) ( p+1,5) x i+1 x p () ( p+1,0) (0,5) ( p+1,5) xi x i+1 z 2 p z p+1 z 2 p z p+1 z 1 y p (2,3) (2,2) y 1 (p 1,3) (p 1,2) y i y i+1 zp z 1 y p y 1 (2,3) (2,2) (p 1,3) (p 1,2) y i y i+1 z p x 1 (0,0) () ( p+1,0) xi x 1 (0,0) (e) ( p+1,0) x i Figure 4: () A oughnut emeing of p-oughnut grph of G, () eges etween four orner verties of R 1 n R 2 re rwn s stright-line segments, () eges etween verties on R 1 n R 2 re rwn, () eges etween four orner verties of R 2 n R 3 re rwn s stright-line segments, n (e) stright-line gri rwing of G.

14 166 Krim n Rhmn Stright-Line Gri Drwings on Liner Are x p (0,5) R 1 ( p+1,5) R p+1 i+1 2 z x z 2 p (1,4) ( p,4) R 3 (2,3) (p 1,3) (2,2) (p 1,2) z 1 (1,1) ( p,1) z p x 1 (0,0) ( p+1,0) x i Figure 5: Illustrtion for the se where z p hs two neighors on C 1. One n oserve tht ll the eges of G onneting verties in {z 2, z 3,..., z p 1 } to verties in {x 2, x 3,.., x i 1 }, n onneting verties in {z p+2, z p+2,..., z 2p 1 } to verties in {x i+2, x i+3,.., x p 1 } n e rwn s stright-line segments without ege rossings. See Figure 4(). We finlly put the verties of C 3 on R 3 s follows. Sine z 1 hs extly one neighor on C 1, y Ft 11(), z 1 hs extly two neighors on C 3. Then, y Ft 11(), z 2p hs extly one neighor on C 3. Let y 1, y 2,..., y p e the verties on C 3 in ounter lokwise orer suh tht y 1 is the right neighor of z 1. Then y p is the left neighor of z 1. We put y 1 on (2, 2) n y p on (2, 3). Clerly the eges (y 1, z 1 ), (y p, z 2p ), (y p, z 1 ) n e rwn s stright-line segments without ege rossings, s illustrte in Figure 4(). We next put neighors of z p n z p+1 on C 3 s we hve put the neighors of z p n z p+1 on C 1 t the other two orners of R 3 in ounter lokwise orer s illustrte in Figure 4(). We put the other verties of C 3 on gri points of R 3 ritrrily preserving their reltive positions on C 3. It is not iffiult to show tht eges from the verties on C 2 to the verties on C 3 n e rwn s stright-line segments without ege rossings. Figure 4(e) illustrtes the omplete stright-line gri rwing of p-oughnut grph. The re requirement of the stright-line gri rwing of p-oughnut grph G is equl to the re of retngle R 1 n the re of R 1 is = (p + 1) 5 = (n/4 + 1) 5 = O(n), where n is the numer of verties in G. Thus we hve stright-line gri rwing of p-oughnut grph on gri of liner re. Clerly the lgorithm tkes liner time. Thus the following theorem hols. Theorem 4 A oughnut grph G of n verties hs stright-line gri rwing on gri of re O(n). Furthermore, the rwing of G n e foun in liner time.

15 JGAA, 13(2) (2009) Spnning Sugrphs of Doughnut Grphs In Setion 4, we hve seen tht oughnut grph mits stright-line gri rwing with liner re. One n esily oserve tht spnning sugrph of oughnut grph lso mits stright-line gri rwing with liner re. Figure 6() illustrtes stright-line gri rwing with liner re of grph G in Figure 6() where G is spnning sugrph of oughnut grph G in Figure 1(). Using trnsformtion from the sugrph isomorphism prolem [8], one n esily prove tht the reognition of spnning sugrph of given grph is n NP-omplete prolem in generl. Hene the reognition of spnning sugrph of oughnut grph seems to e non-trivil prolem. We thus restrit ourselves only to 4-onnete plnr grphs. In this setion, we give neessry n suffiient onition for 4-onnete plnr grph to e spnning sugrph of oughnut grph s in the following theorem. l F 1 k j p F i 2 o h g () m e n f f e g l h n o m p () k i j Figure 6: () A spnning sugrph G of G in Figure 1(), n () stright-line gri rwing of G with re O(n). Theorem 5 Let G e 4-onnete plnr grph with 4p verties where p > 4 n let (G) 5. Let Γ e plnr emeing of G. Assume tht Γ hs extly two vertex isjoint fes F 1 n F 2 eh of whih hs extly p verties. Then G is spnning sugrph of p-oughnut grph if n only if the following onitions () (e) hol. () G hs no ege (x, y) suh tht x V (F 1 ) n y V (F 2 ). () Every fe f of Γ hs t lest one vertex v {V (F 1 ) V (F 2 )}. () For ny vertex x / {V (F 1 ) V (F 2 )}, the totl numer of neighors of x on fes F 1 n F 2 re t most three. () Every fe f of Γ exept the fes F 1 n F 2 hs either three or four verties. (e) For ny x-y pth P suh tht V (P ) {V (F 1 ) V (F 2 )} = n x hs extly two neighors on fe F 1 (F 2 ). Then the following onitions hol. (i) If P is even, then the vertex y hs t most two neighors on fe F 1 (F 2 ) n t most one neighor on fe F 2 (F 1 ).

16 168 Krim n Rhmn Stright-Line Gri Drwings on Liner Are (ii) If P is o, then the vertex y hs t most one neighor on fe F 1 (F 2 ) n t most two neighors on fe F 2 (F 1 ). Ft 1 implies tht the eomposition of 4-onnete plnr grph G into its fil yles is unique. Throughout the setion we thus often mention fes of G without mentioning its plnr emeing where the esription of the fes is vli for ny plnr emeing of G, sine κ(g) 4 for every grph G onsiere in this setion. Before proving the neessity of Theorem 5, we hve the following ft. Ft 12 Let G e 4-onnete plnr grph with 4p verties where p > 4 n let (G) 5. Assume tht G hs extly two vertex isjoint fes F 1 n F 2 eh of whih hs extly p verties. If G is spnning sugrph of oughnut grph then G n e ugmente to 5-onnete 5-regulr grph G through tringultion of ll the non-tringulte fes of G exept the fes F 1 n F 2. One n esily oserve tht the following ft hols from the onstrution Construt-Doughnut given in Setion 3. Ft 13 Let G e oughnut grph, n let P e ny x-y pth suh tht V (P ) {V (F 1 ) V (F 2 )} = n x hs extly two neighors on fe F 1 (F 2 ). Then the following onitions (i) n (ii) hol. (i) If P is even, then the vertex y hs extly two neighors on fe F 1 (F 2 ) n extly one neighor on fe F 2 (F 1 ). (ii) If P is o, then the vertex y hs extly one neighor on fe F 1 (F 2 ) n extly two neighors on fe F 2 (F 1 ). We re rey to prove the neessity of Theorem 5. Proof for the Neessity of Theorem 5 Assume tht G is spnning sugrph of p-oughnut grph. Then y Theorem 1 G hs 4p verties. Clerly (G) 5 n G stisfies the onitions (), () n (), otherwise G woul not e spnning sugrph of oughnut grph. The neessity of onition (e) is ovious y Ft 13. Hene it is suffiient to prove the neessity of onition () only. () G oes not hve ny fe of two or less verties sine G is 4-onnete plnr grph. Then every fe of G hs three or more verties. We now show tht G hs no fe of more thn four verties. Assume for ontrition tht G hs fe f of q verties suh tht q > 4. Then f n e tringulte y ing q 3 extr eges. These extr eges inrese the egrees of q 2 verties, n the sum of the egrees will e inrese y 2(q 3). Using the pigeonhole priniple, one n esily oserve tht there is vertex mong the q(> 4) verties whose egree will e rise y t lest 2 fter tringultion of f. Then G woul hve vertex of egree six or more where G is grph otine fter tringultion of f. Hene we nnot ugment G to 5-regulr grph through tringultion of ll the non-tringulte fes of G other thn the fes F 1 n F 2. Therefore G nnot e spnning sugrph of oughnut

17 JGAA, 13(2) (2009) 169 grph y Ft 12, ontrition. Hene eh fe f of G exept F 1 n F 2 hs either three or four verties. In the remining of this setion we give onstrutive proof for the suffiieny of Theorem 5. Assume tht G stisfies the onitions in Theorem 5. We hve the following lemm. Lemm 14 Let G e 4-onnete plnr grph stisfying the onitions in Theorem 5. Assume tht ll the fes of G exept F 1 n F 2 re tringulte. Then G is oughnut grph. Proof: To prove the lim, we hve to prove tht (i) G is 5-onnete, (ii) G hs two vertex isjoint fes eh of whih hs extly p, p > 4, verties, n ll the other fes of G hs extly three verties, n (iii) G hs the minimum numer of verties stisfying the properties (i) n (ii). (i) We first prove tht G is 5-regulr grph. Every fe of G exept F 1 n F 2 is tringle. Furthermore eh of F 1 n F 2 hs extly p, p > 4, verties. Then G hs 3(4p) 6 2(p 3) = 10p eges. Sine none of the verties of G hs egree more thn five n G hs extly 10p eges, eh vertex of G hs egree extly five. We next prove tht the verties of G lie on three vertex-isjoint yles C 1, C 2 n C 3 suh tht yles C 1, C 2, C 3 ontin extly p, 2p n p verties, respetively. We tke n emeing Γ of G suh tht F 1 is emee s the outer fe n F 2 is emee s n inner fe. We tke the ontour of fe F 1 s yle C 1 n ontour of fe F 2 s yle C 3. Then eh of C 1 n C 2 ontins extly p, p > 4, verties. Sine G stisfies onitions (), () n () in Theorem 5 n ll the fes of G exept F 1 n F 2 re tringulte, the rest 2p verties of G form yle in Γ. We tke this yle s C 2. G(C 2 ) ontins C 3 sine G stisfies onition () in Theorem 5. Clerly C 1, C 2 n C 3 re vertex-isjoint n yles C 1, C 2, C 3 ontin extly p, 2p n p verties, respetively. We finlly prove tht G is 5-onnete. Assume for ontrition tht G hs ut-set of less thn five verties. In suh se G woul hve vertex of egree less thn five, ontrition. (ii) The proof of this prt is ovious sine G hs two vertex isjoint fes eh of whih hs extly p verties n ll the other fes of G hs extly three verties. (iii) The numer of verties of G is 4p. Using Lemm 2, we n esily prove tht the minimum numer of verties require to onstrut grph G tht stisfies the properties (i) n (ii) is 4p. We thus ssume tht G hs non-tringulte fe f exept fes F 1 n F 2. By onition () in Theorem 5, f is qurngle fe. It is suffiient to show tht we n ugment the grph G to oughnut grph y tringulting eh of the qurngle fes of G. However, we nnot ugment G to oughnut grph y tringulting eh qurngle fe ritrrily. For exmple, the grph G in Figure 7() stisfies ll the onitions in Theorem 5 n it hs extly one qurngle fe f 1 (,,, ). If we tringulte f 1 y ing n

18 170 Krim n Rhmn Stright-Line Gri Drwings on Liner Are ege (, ) s illustrte in Figure 7(), the resulting grph G woul not e oughnut grph sine oughnut grph oes not hve n ege (, ) suh tht V (F 1 ) n V (F 2 ). But if we tringulte f 1 y ing n ege (, ) s illustrte in Figure 7(), the resulting grph G is oughnut grph. Hene every tringultion of qurngle fe is not lwys vli to ugment G to oughnut grph. We ll tringultion of qurngle fe f of G vli tringultion if the resulting grph G otine fter the tringultion of f oes not ontrit ny onition in Theorem 5. We ll vertex v on the ontour of qurngle fe f goo vertex if v is one of the en vertex of n ege whih is e for vli tringultion of f. F 1 F 1 F 1 F 2 F 2 F 2 () () () Figure 7: () f 1 (,,, ) is qurngle fe, () the tringultion of f 1 y ing the ege (, ) n () the tringultion of f 1 y ing the ege (, ). We ll qurngle fe f of G n α-fe if f ontins t lest one vertex from eh of the fes F 1 n F 2. Otherwise, we ll qurngle fe f of G β-fe. In Figure 8, f 1 (,,, ) is n α-fe wheres f 2 (p, q, r, s) is β-fe. F 1 F 2 p q r s Figure 8: f 1 (,,, ) is n α-fe n f 2 (p, q, r, s) is β-fe. In vli tringultion of n α-fe f of G no ege is e etween ny two verties x, y V (f) suh tht x V (F 1 ) n y V (F 2 ). Hene the following ft hols on n α-fe f. Ft 15 Let G e 4-onnete plnr grph stisfying the onitions in Theorem 5. Let f e n α-fe in G. Then f mits unique vli tringultion n the tringultion is otine y ing n ege etween two verties those re not on F 1 n F 2.

19 JGAA, 13(2) (2009) 171 Fes f 1 (,,, ) n f 2 (p, q, r, s) in Figure 9() re two α-fes n Figure 9() illustrtes the vli tringultions of f 1 n f 2. Verties n of f 1 n verties q n s of f 2 re goo verties. F 1 F 1 r F 2 r F 2 q s p () q s p () Figure 9: () f 1 (,,, ) n f 2 (p, q, r, s) re two α-fes, n () vli tringultions of f 1 n f 2. We ll β-fe β 1 -fe if the fe ontins extly one vertex either from F 1 or from F 2. Otherwise we ll β-fe β 2 -fe. In Figure 10, f 1 (,,, ) is β 1 -fe wheres f 2 (p, q, r, s) is β 2 -fe. We ll vertex v on the ontour of β 1 -fe f mile vertex of f if the vertex is in the mile position mong the three onseutive verties other thn the vertex on F 1 or F 2. In Figure 10, vertex of f 1 n vertex r of f 2 re the mile verties of f 1 n f 2, respetively. F 1 F 2 q p r s Figure 10: f 1 (,,, ) is β 1 -fe n f 2 (p, q, r, s) is β 2 -fe. In vli tringultion of β 1 -fe f of G no ege is e etween ny two verties x, y V (f) suh tht x, y / V (F 1 ) V (F 2 ). Hene the following ft hols on β 1 -fe f. Ft 16 Let G e 4-onnete plnr grph stisfying the onitions in Theorem 5. Let f e β 1 -fe of G. Then f mits unique vli tringultion n the tringultion is otine y ing n ege etween the vertex on F 1 or F 2 n the mile vertex. Fes f 1 (,,, ) n f 2 (p, q, r, s) in Figure 11() re two β 1 -fes n Figure 11() illustrtes the vli tringultions of f 1 n f 2. Verties n of f 1 n verties p n r of f 2 re goo verties.

20 172 Krim n Rhmn Stright-Line Gri Drwings on Liner Are F 1 F 1 F 2 F2 q r p () s q r p () s Figure 11: () f 1 (,,, ) n f 2 (p, q, r, s) re two β 1 -fes, n () vli tringultions of f 1 n f 2. In vli tringultion of β 2 -fe f of G no ege is e etween ny two verties x, y V (f) where x V (F 1 )(V (F 2 )), y / {V (F 1 ) V (F 1 )} n G hs either (i) n even q-y pth P suh tht q hs extly two neighors on F 2 (F 1 ) n V (P ) {V (F 1 ) V (F 2 )} =, or (ii) n o q-y pth P suh tht q hs extly two neighors on F 1 (F 2 ) n V (P ) {V (F 1 ) V (F 2 )} =. Hene the following ft hols on β 2 -fe f. Ft 17 Let G e 4-onnete plnr grph stisfying the onitions in Theorem 5. Let f e β 2 -fe of G. Then f mits unique vli tringultion n the tringultion is otine y ing n ege etween vertex on fe F 1 or F 2 n vertex z / V (F 1 ) V (F 2 ). Fe f 1 (,,, ) in the grph in Figure 12() is β 2 -fe n the grph hs n even u- pth P suh tht u hs extly two neighors g n h on F 2, n V (P ) {V (F 1 ) V (F 2 )} =. Figure 12() illustrtes the vli tringultion of f 1. Verties n re the goo verties of f 1. Fe f 2 (l, m, n, o) in the grph in Figure 12() is β 2 -fe n the grph hs n o v-o pth P suh tht v hs extly two neighors s n t on F 1, n V (P ) {V (F 1 ) V (F 2 )} =. Figure 12() illustrtes the vli tringultion of f 2. Verties l n n re the goo verties of f 2. Before giving proof for the suffiieny of Theorem 5 we nee to prove the following Lemms 18 n 19. Lemm 18 Let G e 4-onnete plnr grph stisfying the onitions in Theorem 5. Then ny qurngle fe f of G mits unique vli tringultion suh tht fter tringultion (v) 5 hols for ny vertex v in the resulting grph. Proof: By Fts 15, 16 n 17, f mits unique vli tringultion. Sine vli tringultion inreses the egree of goo vertex y one, it is suffiient to show tht eh goo vertex of f hs egree less thn five in G. Assume for ontrition tht goo vertex v hs egree more thn four in G. Then one n oserve tht G woul violte onition in Theorem 5.

21 JGAA, 13(2) (2009) 173 F1 F 2 l F1 n o F 2 m F1 F 2 l F1 n o F 2 m h h g s v g s v u u () t t () () () Figure 12: Illustrtion for vli tringultion of β 2 -fe; () β 2 fe f 1 (,,, ) in grph stisfying onition (i), () β 2 fe f 2 (l, m, n, o) in grph stisfying onition(ii), () the vli tringultion of f 1 n () the vli tringultion of f 2. Lemm 19 Let G e 4-onnete plnr grph stisfying the onitions in Theorem 5. Also ssume tht G hs qurngle fes. Then no two qurngle fes f 1 n f 2 hve ommon vertex whih is goo vertex for oth the fes f 1 n f 2. Proof: Assume tht u is ommon vertex etween two qurngle fes f 1 n f 2. If u is neither goo vertex of f 1 nor goo vertex of f 2, then we hve one. We thus ssume tht u is goo vertex of f 1 or f 2. Without loss of generlity, we ssume tht u is goo vertex of f 1. Then u is not goo vertex of f 2, otherwise u woul not e ommon vertex of f 1 n f 2, ontrition. Proof for the Suffiieny of Theorem 5 Assume tht the grph G stisfies ll the onitions in Theorem 5. If ll the fes of G exept F 1 n F 2 re tringulte, then G is oughnut grph y Lemm 14. Otherwise, we tringulte eh qurngle fe of G, using its vli tringultion. Let G e the resulting grph. Lemms 18 n 19 imply tht (v) 5 for eh vertex v in G. Then the grph G stisfies the onitions in Theorem 5, sine G stisfies the onitions in Theorem 5, G is otine from G using vli tringultions of qurngle fes n (v) 5 for eh vertex v in G. Hene G is oughnut grph y Lemm 14. Therefore G is spnning sugrph of oughnut grph. We now hve the following lemm. Lemm 20 Let G e 4-onnete plnr grph stisfying the onitions in Theorem 5. Then G n e ugmente to oughnut grph in liner time. Proof: We first eme G suh tht F 1 is emee s the outer fe n F 2 is emee s n inner fe. We then tringulte eh of the qurngle fes of G using its vli tringultion if G hs qurngle fes. Let G e the resulting grph. As shown in the suffiieny proof of Theorem 5, G is

22 174 Krim n Rhmn Stright-Line Gri Drwings on Liner Are oughnut grph. One n esily fin ll qurngle fes of G n perform their vli tringultions in liner time, hene G n e otine in liner time. In Theorem 5 we hve given neessry n suffiient onition for 4- onnete plnr grph to e spnning sugrph of oughnut grph. As esrie in the proof of Lemm 20, we hve provie liner-time lgorithm to ugment 4-onnete plnr grph G to oughnut grph if G stisfies the onitions in Theorem 5. We hve thus ientifie sulss of 4-onnete plnr grphs tht mits stright-line gri rwings with liner re s stte in the following theorem. Theorem 6 Let G e 4-onnete plnr grph stisfying the onitions in Theorem 5. Then G mits stright-line gri rwing on gri of re O(n). Furthermore, the rwing of G n e foun in liner time. Proof: Using the metho esrie in the proof of Lemm 20, we ugment G to oughnut grph G y ing ummy eges (if require) in liner time. By Theorem 4, G mits stright-line gri rwing on gri of re O(n). We finlly otin rwing of G from the rwing of G y eleting the ummy eges (if ny) from the rwing of G. By Lemm 20, G n e ugmente to oughnut grph in liner time n y Theorem 4, stright-line gri rwing of oughnut grph n e foun in liner time. Moreover, the ummy eges n lso e elete from the rwing of oughnut grph in liner time. Hene the rwing of G n e foun in liner time. 6 Conlusion In this pper we introue new lss of plnr grphs, lle oughnut grphs, whih is sulss of 5-onnete plnr grphs. A grph in this lss hs stright-line gri rwing on gri of liner re, n the rwing n e foun in liner time. We showe tht the outerplnrity of oughnut grph is 3. Thus we ientifie sulss of 3-outerplnr grphs tht mits stright-line gri rwing with liner re. One n esily oserve tht ny spnning sugrph of oughnut grph lso mits stright-line gri rwing with liner re. However, the reognition of spnning sugrph of oughnut grph seems to e non-trivil prolem. We estlishe neessry n suffiient onition for 4-onnete plnr grph G to e spnning sugrph of oughnut grph. We lso gve liner-time lgorithm to ugment 4-onnete plnr grph G to oughnut grph if G stisfies the neessry n suffiient onition. By introuing the neessry n suffiient onition, in ft, we hve ientifie sulss of 4-onnete plnr grphs tht mits stright-line gri rwings with liner re. Fining other nontrivil lsses of plnr grphs tht mit stright-line gri rwings on gris of liner re is lso left s n open prolem.

23 JGAA, 13(2) (2009) 175 Aknowlegements We thnk the referees n the orresponing eitor for their useful omments whih improve the presenttion of the pper.

24 176 Krim n Rhmn Stright-Line Gri Drwings on Liner Are Referenes [1] F. Brnenurg, D. Eppstein, M. Goorih, S. Koourov, G. Liott, n P. Mutzel. Selete open prolems in grph rwing. In Proeeings of Grph Drwing 2003, volume 2912 of Let. Notes in Computer Siene, pges Springer, [2] M. Chrok n S. Nkno. Minimum-with gri rwings of plne grphs. Computtionl Geometry: Theory n Applitions, 11:29 54, [3] H. e Frysseix, J. Ph, n R. Pollk. How to rw plnr grph on gri. Comintori, 10:41 51, [4] G. Di Bttist, P. Ees, R. Tmssi, n I. G. Tollis. Grph Drwing: Algorithms for the Visuliztion of Grphs. Prentie-Hll In., Upper Sle River, New Jersey, [5] G. Di Bttist n F. Frti. Smll re rwings of outerplnr grphs. In Proeeings of Grph Drwing 2005, volume 3843 of Let. Notes in Computer Siene, pges Springer, [6] I. Fry. On stright line representtion of plnr grphs. At Si. Mth. Szege, 11: , [7] F. Frti n M. Ptrignni. A note on minimum-re stright-line rwings of plnr grphs. In Proeeings of Grph Drwing 2007, volume 4875 of Let. Notes in Computer Siene, pges Springer, [8] M. R. Grey n D. S. Johnson. Computers n Intrtility: A guie to the theory of NP-ompleteness. W. H. Freemn n Compny, New York, [9] A. Grg n A. Rusu. Stright-line rwings of inry trees with liner re n ritrry spet rtion. Journl of Grph Algorithms n Applitions, 8(2): , [10] A. Grg n A. Rusu. Are-effiient plnr stright-line rwings of outerplnr grphs. Disrete Applie Mthemtis, 155(9): , [11] M. Jünger n P. Mutzel, eitors. Grph Drwing Softwre. Springer, Berlin, [12] M. R. Krim n M. S. Rhmn. Stright-line gri rwings of plnr grphs with liner re. In Proeeings of Asi-Pifi Symposium on Visulistion 2007, pges IEEE, [13] M. R. Krim n M. S. Rhmn. Four-onnete spnning sugrphs of oughnut grphs. In Proeeings of Workshop on Algorithms n Computtion 2008, volume 4921 of Let. Notes in Computer Siene, pges Springer, 2008.

25 JGAA, 13(2) (2009) 177 [14] M. Kufmnn n D. Wgner, eitors. Drwing Grphs: Methos n Moels, volume 2025 of Let. Notes in Computer Siene. Springer, Berlin, [15] K. Miur, S. Nkno, n T. Nishizeki. Gri rwings of four-onnete plnr grphs. Disrete n Computtionl Geometry, 26(1):73 78, [16] T. Nishizeki n M. S. Rhmn. Plnr Grph Drwing. Worl Sientifi, Singpore, [17] W. Shnyer. Emeing plnr grphs on the gri. In Proeeings of First ACM-SIAM Symposium on Disrete Algorithms, pges , [18] K. S. Stein. Convex mps. In Proeeings of the Amerin Mthemtil Soiety, volume 2, pges , [19] K. Wgner. Bemerkungen zum Veierfrenprolem. In Jhreseriht Deutshe Mth. Verein., volume 46, pges 26 32, 1936.

CS 491G Combinatorial Optimization Lecture Notes

CS 491G Combinatorial Optimization Lecture Notes CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

More information

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into

More information

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite! Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:

More information

CIT 596 Theory of Computation 1. Graphs and Digraphs

CIT 596 Theory of Computation 1. Graphs and Digraphs CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege

More information

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if

More information

Monochromatic Plane Matchings in Bicolored Point Set

Monochromatic Plane Matchings in Bicolored Point Set CCCG 2017, Ottw, Ontrio, July 26 28, 2017 Monohromti Plne Mthings in Biolore Point Set A. Krim Au-Affsh Sujoy Bhore Pz Crmi Astrt Motivte y networks interply, we stuy the prolem of omputing monohromti

More information

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or Multi-Grph We llow loops n multiple eges. G = (V, E.ψ)

More information

SOME COPLANAR POINTS IN TETRAHEDRON

SOME COPLANAR POINTS IN TETRAHEDRON Journl of Pure n Applie Mthemtis: Avnes n Applitions Volume 16, Numer 2, 2016, Pges 109-114 Aville t http://sientifivnes.o.in DOI: http://x.oi.org/10.18642/jpm_7100121752 SOME COPLANAR POINTS IN TETRAHEDRON

More information

POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS

POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS Bull. Koren Mth. So. 35 (998), No., pp. 53 6 POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS YOUNG BAE JUN*, YANG XU AND KEYUN QIN ABSTRACT. We introue the onepts of positive

More information

On the Spectra of Bipartite Directed Subgraphs of K 4

On the Spectra of Bipartite Directed Subgraphs of K 4 On the Spetr of Biprtite Direte Sugrphs of K 4 R. C. Bunge, 1 S. I. El-Znti, 1, H. J. Fry, 1 K. S. Kruss, 2 D. P. Roerts, 3 C. A. Sullivn, 4 A. A. Unsiker, 5 N. E. Witt 6 1 Illinois Stte University, Norml,

More information

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 ) Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us

More information

arxiv: v2 [math.co] 31 Oct 2016

arxiv: v2 [math.co] 31 Oct 2016 On exlue minors of onnetivity 2 for the lss of frme mtrois rxiv:1502.06896v2 [mth.co] 31 Ot 2016 Mtt DeVos Dryl Funk Irene Pivotto Astrt We investigte the set of exlue minors of onnetivity 2 for the lss

More information

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of: 22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)

More information

arxiv: v1 [cs.cg] 28 Apr 2009

arxiv: v1 [cs.cg] 28 Apr 2009 Orienttion-Constrine Retngulr Lyouts Dvi Eppstein 1 n Elen Mumfor 2 1 Deprtment of Computer Siene, University of Cliforni, Irvine, USA 2 Deprtment of Mthemtis n Computer Siene, TU Einhoven, The Netherlns

More information

Maximizing Maximal Angles for Plane Straight-Line Graphs

Maximizing Maximal Angles for Plane Straight-Line Graphs Mximizing Mximl Angles for Plne Stright-Line Grphs Oswin Aihholzer 1, Thoms Hkl 1, Mihel Hoffmnn 2, Clemens Huemer 3, Attil Pór 4, Frniso Sntos 5, Bettin Spekmnn 6, n Birgit Vogtenhuer 1 1 Institute for

More information

Maximum size of a minimum watching system and the graphs achieving the bound

Maximum size of a minimum watching system and the graphs achieving the bound Mximum size of minimum wthing system n the grphs hieving the oun Tille mximum un système e ontrôle minimum et les grphes tteignnt l orne Dvi Auger Irène Chron Olivier Hury Antoine Lostein 00D0 Mrs 00 Déprtement

More information

Exercise sheet 6: Solutions

Exercise sheet 6: Solutions Eerise sheet 6: Solutions Cvet emptor: These re merel etended hints, rther thn omplete solutions. 1. If grph G hs hromti numer k > 1, prove tht its verte set n e prtitioned into two nonempt sets V 1 nd

More information

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

CS261: A Second Course in Algorithms Lecture #5: Minimum-Cost Bipartite Matching

CS261: A Second Course in Algorithms Lecture #5: Minimum-Cost Bipartite Matching CS261: A Seon Course in Algorithms Leture #5: Minimum-Cost Biprtite Mthing Tim Roughgren Jnury 19, 2016 1 Preliminries Figure 1: Exmple of iprtite grph. The eges {, } n {, } onstitute mthing. Lst leture

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

arxiv: v1 [cs.dm] 24 Jul 2017

arxiv: v1 [cs.dm] 24 Jul 2017 Some lsses of grphs tht re not PCGs 1 rxiv:1707.07436v1 [s.dm] 24 Jul 2017 Pierluigi Biohi Angelo Monti Tizin Clmoneri Rossell Petreshi Computer Siene Deprtment, Spienz University of Rome, Itly pierluigi.iohi@gmil.om,

More information

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion

More information

Obstructions to chordal circular-arc graphs of small independence number

Obstructions to chordal circular-arc graphs of small independence number Ostrutions to horl irulr-r grphs of smll inepenene numer Mthew Frnis,1 Pvol Hell,2 Jurj Stho,3 Institute of Mth. Sienes, IV Cross Ro, Trmni, Chenni 600 113, Ini Shool of Comp. Siene, Simon Frser University,

More information

Separable discrete functions: recognition and sufficient conditions

Separable discrete functions: recognition and sufficient conditions Seprle isrete funtions: reognition n suffiient onitions Enre Boros Onřej Čepek Vlimir Gurvih Novemer 21, 217 rxiv:1711.6772v1 [mth.co] 17 Nov 217 Astrt A isrete funtion of n vriles is mpping g : X 1...

More information

MCH T 111 Handout Triangle Review Page 1 of 3

MCH T 111 Handout Triangle Review Page 1 of 3 Hnout Tringle Review Pge of 3 In the stuy of sttis, it is importnt tht you e le to solve lgeri equtions n tringle prolems using trigonometry. The following is review of trigonometry sis. Right Tringle:

More information

Lecture 2: Cayley Graphs

Lecture 2: Cayley Graphs Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re

More information

Lecture 4: Graph Theory and the Four-Color Theorem

Lecture 4: Graph Theory and the Four-Color Theorem CCS Disrete II Professor: Pri Brtlett Leture 4: Grph Theory n the Four-Color Theorem Week 4 UCSB 2015 Through the rest of this lss, we re going to refer frequently to things lle grphs! If you hen t seen

More information

The vertex leafage of chordal graphs

The vertex leafage of chordal graphs The vertex lefge of horl grphs Steven Chplik, Jurj Stho b Deprtment of Physis n Computer Siene, Wilfri Lurier University, 75 University Ave. West, Wterloo, Ontrio N2L 3C5, Cn b DIMAP n Mthemtis Institute,

More information

Logic, Set Theory and Computability [M. Coppenbarger]

Logic, Set Theory and Computability [M. Coppenbarger] 14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer

More information

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014 S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown

More information

Graph Algorithms. Vertex set = { a,b,c,d } Edge set = { {a,c}, {b,c}, {c,d}, {b,d}} Figure 1: An example for a simple graph

Graph Algorithms. Vertex set = { a,b,c,d } Edge set = { {a,c}, {b,c}, {c,d}, {b,d}} Figure 1: An example for a simple graph Inin Institute of Informtion Tehnology Design n Mnufturing, Knheepurm, Chenni 00, Ini An Autonomous Institute uner MHRD, Govt of Ini http://www.iiitm..in COM 0T Design n Anlysis of Algorithms -Leture Notes

More information

September 30, :24 WSPC/Guidelines Y4Spanner

September 30, :24 WSPC/Guidelines Y4Spanner Septemer 30, 2011 12:24 WSPC/Guielines Y4Spnner Interntionl Journl of Computtionl Geometry & Applitions Worl Sientifi Pulishing Compny π/2-angle YAO GAPHS AE SPANNES POSENJIT BOSE Shool of Computer Siene,

More information

QUADRATIC EQUATION. Contents

QUADRATIC EQUATION. Contents QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,

More information

SEMI-EXCIRCLE OF QUADRILATERAL

SEMI-EXCIRCLE OF QUADRILATERAL JP Journl of Mthemtil Sienes Volume 5, Issue &, 05, Pges - 05 Ishn Pulishing House This pper is ville online t http://wwwiphsiom SEMI-EXCIRCLE OF QUADRILATERAL MASHADI, SRI GEMAWATI, HASRIATI AND HESY

More information

Vidyalankar S.E. Sem. III [CMPN] Discrete Structures Prelim Question Paper Solution

Vidyalankar S.E. Sem. III [CMPN] Discrete Structures Prelim Question Paper Solution S.E. Sem. III [CMPN] Discrete Structures Prelim Question Pper Solution 1. () (i) Disjoint set wo sets re si to be isjoint if they hve no elements in common. Exmple : A = {0, 4, 7, 9} n B = {3, 17, 15}

More information

Section 4.4. Green s Theorem

Section 4.4. Green s Theorem The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higher-dimensionl nlogues) with the definite integrls

More information

I 3 2 = I I 4 = 2A

I 3 2 = I I 4 = 2A ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents

More information

COMPUTING THE QUARTET DISTANCE BETWEEN EVOLUTIONARY TREES OF BOUNDED DEGREE

COMPUTING THE QUARTET DISTANCE BETWEEN EVOLUTIONARY TREES OF BOUNDED DEGREE COMPUTING THE QUARTET DISTANCE BETWEEN EVOLUTIONARY TREES OF BOUNDED DEGREE M. STISSING, C. N. S. PEDERSEN, T. MAILUND AND G. S. BRODAL Bioinformtis Reserh Center, n Dept. of Computer Siene, University

More information

Section 2.3. Matrix Inverses

Section 2.3. Matrix Inverses Mtri lger Mtri nverses Setion.. Mtri nverses hree si opertions on mtries, ition, multiplition, n sutrtion, re nlogues for mtries of the sme opertions for numers. n this setion we introue the mtri nlogue

More information

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4 Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones

More information

EXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED

EXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED EXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED Astrt. The GCD Str of Dvi Theorem n the numerous ppers relte to it hve lrgel een evote to shoing the equlit

More information

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points: Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer

More information

New and Improved Spanning Ratios for Yao Graphs

New and Improved Spanning Ratios for Yao Graphs New n Improve Spnning Rtios for Yo Grphs Luis Br Déprtement Informtique Université Lire e Bruxelles lrfl@ul..e Rolf Fgererg Deprtment of Computer Siene University of Southern Denmrk rolf@im.su.k Anré vn

More information

COMPUTING THE QUARTET DISTANCE BETWEEN EVOLUTIONARY TREES OF BOUNDED DEGREE

COMPUTING THE QUARTET DISTANCE BETWEEN EVOLUTIONARY TREES OF BOUNDED DEGREE COMPUTING THE QUARTET DISTANCE BETWEEN EVOLUTIONARY TREES OF BOUNDED DEGREE M. STISSING, C. N. S. PEDERSEN, T. MAILUND AND G. S. BRODAL Bioinformtis Reserh Center, n Dept. of Computer Siene, University

More information

Compression of Palindromes and Regularity.

Compression of Palindromes and Regularity. Compression of Plinromes n Regulrity. Kyoko Shikishim-Tsuji Center for Lierl Arts Eution n Reserh Tenri University 1 Introution In [1], property of likstrem t t view of tse is isusse n it is shown tht

More information

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then. pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm

More information

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106 8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly

More information

SIMPLE NONLINEAR GRAPHS

SIMPLE NONLINEAR GRAPHS S i m p l e N o n l i n e r G r p h s SIMPLE NONLINEAR GRAPHS www.mthletis.om.u Simple SIMPLE Nonliner NONLINEAR Grphs GRAPHS Liner equtions hve the form = m+ where the power of (n ) is lws. The re lle

More information

APPENDIX. Precalculus Review D.1. Real Numbers and the Real Number Line

APPENDIX. Precalculus Review D.1. Real Numbers and the Real Number Line APPENDIX D Preclculus Review APPENDIX D.1 Rel Numers n the Rel Numer Line Rel Numers n the Rel Numer Line Orer n Inequlities Asolute Vlue n Distnce Rel Numers n the Rel Numer Line Rel numers cn e represente

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep

More information

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

More information

Now we must transform the original model so we can use the new parameters. = S max. Recruits

Now we must transform the original model so we can use the new parameters. = S max. Recruits MODEL FOR VARIABLE RECRUITMENT (ontinue) Alterntive Prmeteriztions of the pwner-reruit Moels We n write ny moel in numerous ifferent ut equivlent forms. Uner ertin irumstnes it is onvenient to work with

More information

Discrete Structures Lecture 11

Discrete Structures Lecture 11 Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.

More information

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment

More information

Solids of Revolution

Solids of Revolution Solis of Revolution Solis of revolution re rete tking n re n revolving it roun n is of rottion. There re two methos to etermine the volume of the soli of revolution: the isk metho n the shell metho. Disk

More information

Mathematical Proofs Table of Contents

Mathematical Proofs Table of Contents Mthemtil Proofs Tle of Contents Proof Stnr Pge(s) Are of Trpezoi 7MG. Geometry 8.0 Are of Cirle 6MG., 9 6MG. 7MG. Geometry 8.0 Volume of Right Cirulr Cyliner 6MG. 4 7MG. Geometry 8.0 Volume of Sphere Geometry

More information

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t

More information

Generalized Kronecker Product and Its Application

Generalized Kronecker Product and Its Application Vol. 1, No. 1 ISSN: 1916-9795 Generlize Kroneker Prout n Its Applition Xingxing Liu Shool of mthemtis n omputer Siene Ynn University Shnxi 716000, Chin E-mil: lxx6407@163.om Astrt In this pper, we promote

More information

#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS

#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS #A42 INTEGERS 11 (2011 ON THE CONDITIONED BINOMIAL COEFFICIENTS Liqun To Shool of Mthemtil Sienes, Luoyng Norml University, Luoyng, Chin lqto@lynuedun Reeived: 12/24/10, Revised: 5/11/11, Aepted: 5/16/11,

More information

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6 CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized

More information

SOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVEX STOCHASTIC PROCESSES ON THE CO-ORDINATES

SOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVEX STOCHASTIC PROCESSES ON THE CO-ORDINATES Avne Mth Moels & Applitions Vol3 No 8 pp63-75 SOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVE STOCHASTIC PROCESSES ON THE CO-ORDINATES Nurgül Okur * Imt Işn Yusuf Ust 3 3 Giresun University Deprtment

More information

Subsequence Automata with Default Transitions

Subsequence Automata with Default Transitions Susequene Automt with Defult Trnsitions Philip Bille, Inge Li Gørtz, n Freerik Rye Skjoljensen Tehnil University of Denmrk {phi,inge,fskj}@tu.k Astrt. Let S e string of length n with hrters from n lphet

More information

Proving the Pythagorean Theorem

Proving the Pythagorean Theorem Proving the Pythgoren Theorem W. Bline Dowler June 30, 2010 Astrt Most people re fmilir with the formul 2 + 2 = 2. However, in most ses, this ws presented in lssroom s n solute with no ttempt t proof or

More information

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233, Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.

More information

Minimum-Area Drawings of Plane 3-Trees

Minimum-Area Drawings of Plane 3-Trees Journl o Grh Algorithms nd Alitions htt://jg.ino/ vol. 15, no. 2,. 177 204 (2011) Minimum-Are Drwings o Plne -Trees Dejyoti Mondl Rhnum Islm Nisht Md. Sidur Rhmn Muhmmd Jwherul Alm Grh Drwing nd Inormtion

More information

GM1 Consolidation Worksheet

GM1 Consolidation Worksheet Cmridge Essentils Mthemtis Core 8 GM1 Consolidtion Worksheet GM1 Consolidtion Worksheet 1 Clulte the size of eh ngle mrked y letter. Give resons for your nswers. or exmple, ngles on stright line dd up

More information

CS 360 Exam 2 Fall 2014 Name

CS 360 Exam 2 Fall 2014 Name CS 360 Exm 2 Fll 2014 Nme 1. The lsses shown elow efine singly-linke list n stk. Write three ifferent O(n)-time versions of the reverse_print metho s speifie elow. Eh version of the metho shoul output

More information

The DOACROSS statement

The DOACROSS statement The DOACROSS sttement Is prllel loop similr to DOALL, ut it llows prouer-onsumer type of synhroniztion. Synhroniztion is llowe from lower to higher itertions sine it is ssume tht lower itertions re selete

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005 RLETON UNIVERSIT eprtment of Eletronis ELE 2607 Swithing iruits erury 28, 05; 0 pm.0 Prolems n Most Solutions, Set, 2005 Jn. 2, #8 n #0; Simplify, Prove Prolem. #8 Simplify + + + Reue to four letters (literls).

More information

A Study on the Properties of Rational Triangles

A Study on the Properties of Rational Triangles Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn

More information

If the numbering is a,b,c,d 1,2,3,4, then the matrix representation is as follows:

If the numbering is a,b,c,d 1,2,3,4, then the matrix representation is as follows: Reltions. Solutions 1. ) true; ) true; ) flse; ) true; e) flse; f) true; g) flse; h) true; 2. 2 A B 3. Consier ll reltions tht o not inlue the given pir s n element. Oviously, the rest of the reltions

More information

Finite State Automata and Determinisation

Finite State Automata and Determinisation Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions

More information

Computing all-terminal reliability of stochastic networks with Binary Decision Diagrams

Computing all-terminal reliability of stochastic networks with Binary Decision Diagrams Computing ll-terminl reliility of stohsti networks with Binry Deision Digrms Gry Hry 1, Corinne Luet 1, n Nikolos Limnios 2 1 LRIA, FRE 2733, 5 rue u Moulin Neuf 80000 AMIENS emil:(orinne.luet, gry.hry)@u-pirie.fr

More information

Factorising FACTORISING.

Factorising FACTORISING. Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties

More information

A Disambiguation Algorithm for Finite Automata and Functional Transducers

A Disambiguation Algorithm for Finite Automata and Functional Transducers A Dismigution Algorithm for Finite Automt n Funtionl Trnsuers Mehryr Mohri Cournt Institute of Mthemtil Sienes n Google Reserh 51 Merer Street, New York, NY 1001, USA Astrt. We present new ismigution lgorithm

More information

Introduction to Olympiad Inequalities

Introduction to Olympiad Inequalities Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................

More information

Solutions to Problem Set #1

Solutions to Problem Set #1 CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors

More information

Geodesics on Regular Polyhedra with Endpoints at the Vertices

Geodesics on Regular Polyhedra with Endpoints at the Vertices Arnol Mth J (2016) 2:201 211 DOI 101007/s40598-016-0040-z RESEARCH CONTRIBUTION Geoesis on Regulr Polyher with Enpoints t the Verties Dmitry Fuhs 1 To Sergei Thnikov on the osion of his 60th irthy Reeive:

More information

On Implicative and Strong Implicative Filters of Lattice Wajsberg Algebras

On Implicative and Strong Implicative Filters of Lattice Wajsberg Algebras Glol Journl of Mthemtil Sienes: Theory nd Prtil. ISSN 974-32 Volume 9, Numer 3 (27), pp. 387-397 Interntionl Reserh Pulition House http://www.irphouse.om On Implitive nd Strong Implitive Filters of Lttie

More information

y = c 2 MULTIPLE CHOICE QUESTIONS (MCQ's) (Each question carries one mark) is...

y = c 2 MULTIPLE CHOICE QUESTIONS (MCQ's) (Each question carries one mark) is... . Liner Equtions in Two Vriles C h p t e r t G l n e. Generl form of liner eqution in two vriles is x + y + 0, where 0. When we onsier system of two liner equtions in two vriles, then suh equtions re lle

More information

THE PYTHAGOREAN THEOREM

THE PYTHAGOREAN THEOREM THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this

More information

Comparing the Pre-image and Image of a Dilation

Comparing the Pre-image and Image of a Dilation hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity

More information

CIRCULAR COLOURING THE PLANE

CIRCULAR COLOURING THE PLANE CIRCULAR COLOURING THE PLANE MATT DEVOS, JAVAD EBRAHIMI, MOHAMMAD GHEBLEH, LUIS GODDYN, BOJAN MOHAR, AND REZA NASERASR Astrct. The unit distnce grph R is the grph with vertex set R 2 in which two vertices

More information

Linear choosability of graphs

Linear choosability of graphs Liner hoosility of grphs Louis Esperet, Mikel Montssier, André Rspud To ite this version: Louis Esperet, Mikel Montssier, André Rspud. Liner hoosility of grphs. Stefn Felsner. 2005 Europen Conferene on

More information

Lower Bounds on the Area Requirements of Series-Parallel Graphs

Lower Bounds on the Area Requirements of Series-Parallel Graphs Discrete Mthemtics nd Theoreticl Computer Science DMTCS vol. 12:5, 2010, 139 174 Lower Bounds on the Are Requirements of Series-Prllel Grphs Frizio Frti Università Rom Tre, Itly, nd École Polytechnique

More information

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd

More information

5. Every rational number have either terminating or repeating (recurring) decimal representation.

5. Every rational number have either terminating or repeating (recurring) decimal representation. CHAPTER NUMBER SYSTEMS Points to Rememer :. Numer used for ounting,,,,... re known s Nturl numers.. All nturl numers together with zero i.e. 0,,,,,... re known s whole numers.. All nturl numers, zero nd

More information

Computing the Quartet Distance between Evolutionary Trees in Time O(n log n)

Computing the Quartet Distance between Evolutionary Trees in Time O(n log n) Computing the Qurtet Distne etween Evolutionry Trees in Time O(n log n) Gerth Stølting Brol, Rolf Fgererg Christin N. S. Peersen Mrh 3, 2003 Astrt Evolutionry trees esriing the reltionship for set of speies

More information

Common intervals of genomes. Mathieu Raffinot CNRS LIAFA

Common intervals of genomes. Mathieu Raffinot CNRS LIAFA Common intervls of genomes Mthieu Rffinot CNRS LIF Context: omprtive genomis. set of genomes prtilly/totlly nnotte Informtive group of genes or omins? Ex: COG tse Mny iffiulties! iology Wht re two similr

More information

A CLASS OF GENERAL SUPERTREE METHODS FOR NESTED TAXA

A CLASS OF GENERAL SUPERTREE METHODS FOR NESTED TAXA A CLASS OF GENERAL SUPERTREE METHODS FOR NESTED TAXA PHILIP DANIEL AND CHARLES SEMPLE Astrt. Amlgmting smller evolutionry trees into single prent tree is n importnt tsk in evolutionry iology. Trditionlly,

More information

VECTOR ALGEBRA. Syllabus :

VECTOR ALGEBRA. Syllabus : MV VECTOR ALGEBRA Syllus : Vetors nd Slrs, ddition of vetors, omponent of vetor, omponents of vetor in two dimensions nd three dimensionl spe, slr nd vetor produts, slr nd vetor triple produt. Einstein

More information

Total score: /100 points

Total score: /100 points Points misse: Stuent's Nme: Totl sore: /100 points Est Tennessee Stte University Deprtment of Computer n Informtion Sienes CSCI 2710 (Trnoff) Disrete Strutures TEST 2 for Fll Semester, 2004 Re this efore

More information

Area and Perimeter. Area and Perimeter. Solutions. Curriculum Ready.

Area and Perimeter. Area and Perimeter. Solutions. Curriculum Ready. Are n Perimeter Are n Perimeter Solutions Curriulum Rey www.mthletis.om How oes it work? Solutions Are n Perimeter Pge questions Are using unit squres Are = whole squres Are = 6 whole squres = units =

More information

Eigenvectors and Eigenvalues

Eigenvectors and Eigenvalues MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.

More information

SECTION A STUDENT MATERIAL. Part 1. What and Why.?

SECTION A STUDENT MATERIAL. Part 1. What and Why.? SECTION A STUDENT MATERIAL Prt Wht nd Wh.? Student Mteril Prt Prolem n > 0 n > 0 Is the onverse true? Prolem If n is even then n is even. If n is even then n is even. Wht nd Wh? Eploring Pure Mths Are

More information

3 Angle Geometry. 3.1 Measuring Angles. 1. Using a protractor, measure the marked angles.

3 Angle Geometry. 3.1 Measuring Angles. 1. Using a protractor, measure the marked angles. 3 ngle Geometry MEP Prtie ook S3 3.1 Mesuring ngles 1. Using protrtor, mesure the mrked ngles. () () (d) (e) (f) 2. Drw ngles with the following sizes. () 22 () 75 120 (d) 90 (e) 153 (f) 45 (g) 180 (h)

More information