(4, 2)-Choosability of Planar Graphs with Forbidden Structures
|
|
- Tamsin Hunter
- 5 years ago
- Views:
Transcription
1 Mtmtcs Publctons Mtmtcs (4, )-Coosblty o Plnr Grps wt Forbn Structurs Znr Brkkyzy Iow Stt Unvrsty Crstopr Cox Crn Mllon Unvrsty Mcl Dryko Iow Stt Unvrsty, mryko@stt.u Krstn Honson Coloro Coll Mot Kumbt Unvrsty o Nv, Rno S nxt p or tonl utors Follow ts n tonl works t: ttp://lb.r.stt.u/mt_pubs Prt o t Dscrt Mtmtcs n Combntorcs Commons T complt bblorpc normton or ts tm cn b oun t ttp://lb.r.stt.u/ mt_pubs/11. For normton on ow to ct ts tm, pls vst ttp://lb.r.stt.u/ owtoct.tml. Ts Artcl s brout to you or r n opn ccss by t Mtmtcs t Iow Stt Unvrsty Dtl Rpostory. It s bn ccpt or ncluson n Mtmtcs Publctons by n utorz mnstrtor o Iow Stt Unvrsty Dtl Rpostory. For mor normton, pls contct rp@stt.u.
2 (4, )-Coosblty o Plnr Grps wt Forbn Structurs Abstrct All plnr rps r 4-colorbl n 5-coosbl, wl som plnr rps r not 4-coosbl. Dtrmnn wc proprts urnt tt plnr rp cn b color usn lsts o sz our s rcv sncnt ttnton. In trms o constrnn t structur o t rp, or ny l {,4,5,6,7}" rol="prsntton" styl="box-szn: borr-box; sply: nln; ln-t: norml; lttr-spcn: norml; wor-spcn: norml; wor-wrp: norml; wt-spc: nowrp; lot: non; rcton: ltr; mx-wt: non; mx-t: non; mn-wt: 0px; mn-t: 0px; borr: 0px; pn: 0px; mrn: 0px; poston: rltv;">l {,4,5,6,7}l {,4,5,6,7}, plnr rp s 4-coosbl t s l" rol="prsntton" styl="boxszn: borr-box; sply: nln; ln-t: norml; lttr-spcn: norml; wor-spcn: norml; worwrp: norml; wt-spc: nowrp; lot: non; rcton: ltr; mx-wt: non; mx-t: non; mnwt: 0px; mn-t: 0px; borr: 0px; pn: 0px; mrn: 0px; poston: rltv;">ll-cycl-r. In trms o constrnn t lst ssnmnt, on rnmnt o k-coosblty s coosblty wt sprton. A rp s (k, s)-coosbl t rp s colorbl rom lsts o sz k wr jcnt vrtcs v t most s common colors n tr lsts. Evry plnr rp s (4, 1)-coosbl, but tr xst plnr rps tt r not (4, )-coosbl. It s n opn quston wtr plnr rps r lwys (4, )-coosbl. A corl" rol="prsntton" styl="box-szn: borr-box; sply: nln; ln-t: norml; lttr-spcn: norml; wor-spcn: norml; wor-wrp: norml; wt-spc: nowrp; lot: non; rcton: ltr; mx-wt: non; mx-t: non; mn-wt: 0px; mn-t: 0px; borr: 0px; pn: 0px; mrn: 0px; poston: rltv;">ll-cycl s n l" rol="prsntton" styl="box-szn: borr-box; sply: nln; ln-t: norml; lttr-spcn: norml; wor-spcn: norml; wor-wrp: norml; wt-spc: nowrp; lot: non; rcton: ltr; mx-wt: non; mx-t: non; mn-wt: 0px; mn-t: 0px; borr: 0px; pn: 0px; mrn: 0px; poston: rltv;">ll-cycl wt on tonl. W monstrt or c l {5,6,7}" rol="prsntton" styl="box-szn: borr-box; sply: nln; ln-t: norml; lttr-spcn: norml; wor-spcn: norml; wor-wrp: norml; wt-spc: nowrp; lot: non; rcton: ltr; mx-wt: non; mx-t: non; mn-wt: 0px; mn-t: 0px; borr: 0px; pn: 0px; mrn: 0px; poston: rltv;">l {5,6,7}l {5,6,7} tt plnr rp s (4, )-coosbl t os not contn cor l" rol="prsntton" styl="box-szn: borr-box; sply: nln; ln-t: norml; lttr-spcn: norml; wor-spcn: norml; wor-wrp: norml; wt-spc: nowrp; lot: non; rcton: ltr; mx-wt: non; mx-t: non; mn-wt: 0px; mn-t: 0px; borr: 0px; pn: 0px; mrn: 0px; poston: rltv;">ll-cycls. Kywors Grp colorn, Plnr rp, Coosblty wt sprton, Dscrn Dscplns Dscrt Mtmtcs n Combntorcs Commnts T nl publcton s vlbl t Sprnr v ttp://x.o.or/ /s Brkkyzy, Znr, Crstopr Cox, Mcl Dryko, Krstn Honson, Mot Kumbt, Brnr Lcký, Kcy Mssrscmt t l. "(4, )-coosblty o plnr rps wt orbn structurs." Grps n Combntorcs, no. 4 (017): " Post wt Prmsson Ts rtcl s vlbl t Iow Stt Unvrsty Dtl Rpostory: ttp://lb.r.stt.u/mt_pubs/11
3 Autors Znr Brkkyzy, Crstopr Cox, Mcl Dryko, Krstn Honson, Mot Kumbt, Brnr Lcky, Kcy Mssrscmt, Kvn Moss, Ktln Nowk, Kvn F. Plmowsk, n Mcrosot Ts rtcl s vlbl t Iow Stt Unvrsty Dtl Rpostory: ttp://lb.r.stt.u/mt_pubs/11
4 (4, )-coosblty o plnr rps wt orbn structurs rxv: v1 [mt.co] 11 Dc 015 Znr Brkkyzy 1 Crstopr Cox Mcl Dryko 1 Krstn Honson 1 Mot Kumbt 1 Brnr Lcký 1, Kcy Mssrscmt 1 Kvn Moss 1 Ktln Nowk 1 Kvn F. Plmowsk 1 Drrck Stol 1,4 Dcmbr 14, 015 Abstrct All plnr rps r 4-colorbl n 5-coosbl, wl som plnr rps r not 4- coosbl. Dtrmnn wc proprts urnt tt plnr rp cn b color usn lsts o sz our s rcv sncnt ttnton. In trms o constrnn t structur o t rp, or ny l {,4,5,6,7}, plnr rp s 4-coosbl t s l-cycl-r. In trms o constrnn t lst ssnmnt, on rnmnt o k-coosblty s coosblty wt sprton. A rp s (k,s)-coosbl t rp s colorbl rom lsts o sz k wr jcnt vrtcs v t most s common colors n tr lsts. Evry plnr rp s (4,1)-coosbl, but tr xst plnr rps tt r not (4, )-coosbl. It s n opn quston wtr plnr rps r lwys (4,)-coosbl. A cor l-cycl s n l-cycl wt on tonl. W monstrt or c l {5,6,7} tt plnr rp s (4,)-coosbl t os not contn cor l-cycls. 1 Introucton A propr colorn s n ssnmnt o colors to t vrtcs o rp G suc tt jcnt vrtcs r ssn stnct colors. A (k,s)-lst ssnmnt L s uncton tt ssns lst L(v) o k colors to c vrtx v sott L(v) L(u) s wnvr uv E(G). A proprcolorn φ o G suc tt φ(v) L(v) or ll v V(G) s cll n L-colorn. W sy tt rp G s (k,s)-coosbl, or ny (k,s)-lst ssnmnt L, tr xsts n L-colorn o G. W cll ts vrton o rp colorn coosblty wt sprton. Not tt wn rp s (k, k)-coosbl, w smply sy t s k-coosbl. Obsrv tt G s (k,t)-coosbl, tn G s (k,s)-coosbl or ll s t. A notbl rsult rom Tomssn [11] stts tt vry plnr rp s 5-coosbl, so t ollows tt ll plnr rps r (5,s)-coosbl or ll s 5. Forbn crtn structurs wtn plnr rp s common rstrcton us n rp colorn. Torm 1. summrzs t currnt knowl on (, 1)-coosblty o plnr rps. Škrkovsk [1] conjctur tt ll plnr rps r (, 1)-coosbl; ts quston s stll opn n s prsnt blow s Conjctur Dprtmnt o Mtmtcs, Iow Stt Unvrsty, Ams, IA, U.S.A. {znrb,mryko,kons,mkumbt,lcky,kcymss,kmoss,knowk,kplmow,stol}@stt.u DprtmntoMtmtcl Scncs, Crn Mllon Unvrsty, Pttsbur, PA,U.S.A.cocox@nrw.cmu.u Support by NSF rnt DMS Dprtmnt o Computr Scnc, Iow Stt Unvrsty, Ams, IA, U.S.A. 1
5 Conjctur 1.1 (Škrkovsk [1]). I G s plnr rp, tn G s (,1)-coosbl. Torm 1.. A plnr rp G s (,1)-coosbl G vos ny o t ollown structurs: - -cycls (Krtocvíl, Tuz, Vot [9]). - 4-cycls (Co, Lcký, Stol [4]). - 5-cycls n 6-cycls (Co, Lcký, Stol [4]). In ts ppr, w ocus on 4-coosblty wt sprton. Krtocvíl, Tuz, n Vot [9] prov tt ll plnr rps r (4, 1)-coosbl, wl Vot [1] monstrt tt tr xst plnr rps tt r not (4, )-coosbl. It s not known ll plnr rps r (4, )-coosbl. Conjctur 1. (Krtocvíl, t l. [9]). I G s plnr rp, tn G s (4,)-coosbl. Torm 1.4 (Krtocvíl, t l. [9]). I G s plnr rp, tn G s (4,1)-coosbl. Torm 1.4 ws strntn by Krst n Lcký [8], wr t s sown tt w cn llow n npnnt st o vrtcs to v lsts o sz rtr tn 4. Torm 1.5 (KrstnLcký[8]). Lt G b plnr rp n I V(G) b n npnnt st. I L ssns lsts o colors to V(G) suc tt L(v) or vry v I, n L(v) = 4 or vry v V(G)\I, n L(u) L(v) 1 or ll uv E(G), tn G s n L-colorn. In ton to t work summrz bov, tr r svrl rsults rrn 4-coosblty. A rp s k-nrt c o ts subrps s vrtx o r t most k. Eulr s ormul mpls plnr rp wt no -cycls s -nrt n nc 4-coosbl. Ts n otr smlr rsults r lst blow n Torm 1.6. For t lst rsult n Torm 1.6, not tt cor l-cycl s n l-cycl wt n tonl connctn two o ts non-conscutv vrtcs. Torm 1.6. A plnr rp G s 4-coosbl G vos ny o t ollown structurs: - -cycls (olklor). - 4-cycls (Lm, Xu, Lu, [10]). - 5-cycls (Wn n L [14]). - 6-cycls (Fjvz, Juvn, Mor, n Škrkovsk [7]). - 7-cycls (Frz [6]). - Cor 4-cycls n cor 5-cycls (Boron n Ivnov []). Our mn rsults n ts ppr r lst blow n Torm 1.7. Not tt oubly-cor l-cycl s cor l-cycl wt n tonl. Torm 1.7. A plnr rp G s (4,)-coosbl G vos ny o t ollown structurs: - Cor 5-cycls. - Cor 6-cycls. - Cor 7-cycls. - Doubly-cor 6-cycls n oubly-cor 7-cycls. W prov c cs o Torm 1.7 sprtly. In Scton 4, w orb cor 5-cycls (s Torm 4.1). In Scton 5, w orb cor 6-cycls (s Torm 5.1); w us prts o ts proo to lso prov t cs wn orbn oubly-cor 6-cycls n oubly-cor 7-cycls (s Corollry 5.). In Scton 6, w orb cor 7-cycls (s Torm 6.). Tr r mny turs common to ll o ts proos, wc w tl n Sctons n.
6 1.1 Prlmnrs n Notton Rr to [15] or stnr rp tory trmnoloy n notton. Lt G b rp wt vrtx st V(G) n n st E(G); lt n(g) = V(G). W us K n, C n, n P n to not t complt rp, cycl rp, n pt rp, rspctvly, c on n vrtcs. T opn nboroo o vrtx, not N(v), s t st o vrtcs jcnt to v n G; t clos nboroo, not N[v], s t st N(v) {v}. T r o vrtx v, not G (v), s t numbr o vrtcs jcnt to v n G; w wrt (v) wn t rp G s clr rom t contxt. I t r o vrtx v s k, w cll v k-vrtx; t r o v s t lst k, w cll v k + -vrtx. T lnt o c, not l(), s t lnt o t c bounry wlk. I t lnt o c s k, w cll k-c; t lnt o s t lst k, w cll k + -c. Ovrvw o Mto Alloourmnrsultsustscrnmto. WrrtrrtotsurvysbyBoron[] n Crnston n Wst [5] or n ntroucton to scrn, wc s mto commonly us to obtn rsults on plnr rps. For rl numbrs v,,b, w n ntl cr vlus µ(v) = v (v) b or vry vrtx v n ν() = l() b or vry c. I v > 0, > 0 n v + = b > 0, tn Eulr s ormul mpls tt v µ(v)+ ν() = b, n t totl cr on t ntr rp s ntv. W tn n scrn ruls tt scrb mto or movn cr vlu mon vrtcs n cs wl consrvn t totl cr vlu. W monstrt tt G s mnml countrxmpl to our torm, tn vry vrtx n c ns wt nonntv cr tr t scrn procss, wc s contrcton. Intutvly, ts procss works wll wn orbn structur (suc s sort cor cycl) wt low cr. In Scton, w concrtly n rucbl conurtons. Loosly, rucbl conurton s structurc n rp G wt (4,)-lst ssnmnt L wrny L-colorn o G C xtns to n L-colorn o G. I wr looknor mnml xmplo rptt s not (4,)-coosbl, tn non o ts rucbl conurtons ppr n t rp. W n lr lst o conurtons, (C1) (C1) (s Fur ), n prov ty r rucbl usn vrous nrc constructons. T conurtons (C1) (C10) r us wn orbn cor 6- or 7-cycls, wl t conurtons (C9) (C1) r us wn orbn cor 5-cycls. T us o rnt conurtons s u to rncs n our scrn rumnts. In Scton 4, w orb cor 5-cycls n vry -c s jcnt to t most on otr - c. Morovr, -cs r not jcnt to 4-cs. Tus, our ntl cr uncton n ts cs urnts tt t only objcts wt ntv ntl cr r 4- n 5-vrtcs. In Sctons 5 n 6, w us rnt scrn strty. Our ntl cr vlus urnt tt t only objcts o ntv cr r -cs. Tus, our scrn ruls r sn to sn cr rom 5 + -cs n 4 + -vrtcs to -cs. Howvr, s w orb cor 6-cycls or cor 7-cycls, tr my b mny -cs vry clos to c otr. I G s pln rp n G s ts ul, tn lt F b t st o -cs o G n lt G b t nuc subrp o G wt vrtx st F. A clustr s mxml st o -cs tt r connct n G,.., connct componnt o G. Not tt two -cs srn n r jcnt n G, n two -cs srn only vrtx r not jcnt n G. S Fur 1 or lst o t clustrs wt mxmum cycl lnt sx n vry ntrnl vrtx o r t lst our. In ts urs, t outr cycl s not ncssrly cl cycl, ny r ll wt ry s not c, n pr o squr vrtcs rprsnt snl vrtx. Atonlly, bol s scrb sprtn
7 v v 1 v u 4 u (K) (K4) (K5) (K5b) u 1 u u u 4 v u u v u 5 u 4 1 u 1 u 1 u u 1 u 6 1 u 4 u 5 u 4 u (K5c) (K6) (K6b) (K6c) u u u 5 v 4 1 u 1 u 4 w u 4 1 u 1 5 v u 1 4 u u z 1 u (K6) (K6) (K6) (K6) w (K6) (K6) (K6j) (K6k) (K6l) (K6m) (K6n) (K6o) (K6p) (K6q) (K6r) Ts r ll o t possbl clustrs wt lonst cycl t most sx n mnmum r our. Bol s monstrt sprtn -cycls. Gry rons snt cycls tt r not cs. W roup our clustrs by t lnt o t lonst cycl n t clustr. Tus conurton (Kn) s mxmum cycl lnt o n. Fur 1: Clustrs wt mxmum cycl lnt t most sx. 4
8 -cycls, wc r cycls n pln rp wos xtror n ntror rons bot contn vrtcs not on t cycl. Ts urs r bs on t lst o clustrs us by Frz [6] n t proo tt 7-cycl-r plnr rps r 4-coosbl. For k {1,}, tr s xctly on wy to rrn k -cs n clustr. A trnl s clustr contnn xctly on -c; s (K). A mon s clustr contnn xctly two -cs; s (K4). For k, tr r multpl wys to rrn k -c n clustr. A k-n s clustr o k -cs ll ncnt to common vrtx o r t lst k +1; s (K5) n (K6b). A k-wl s clustr o k -cs ll ncnt to common vrtx o r xctly k; s (K5b) n (K6). Not tt t vrtx ncnt to ll cs o -wl s r. A k-strp s clustr o k -cs 1,..., k wr t bounrs o t -cs r sjont xcpt tt n +1 sr n or {1,...,k 1} n n + sr vrtx or {1,...,k }; s (K5) n (K6). I 1,..., k r t -cs n clustr, tn w wll prov tt t totl cr on 1,..., k tr scrn s nonntv. Tus, som o t -cs my v ntv cr, but ts s blnc by otr -cs n t clustr vn postv cr. Hnc, our proos n wt lst o ll possbl clustr typs n vryn tt c s nonntv totl cr. Wl tr r totl clustrs tt vo cor 7-cycls, w o not v tt mny css to cck. T clustrs (K5c) n (K6) (K6r) v tr bol s, monstrtn sprtn - cycl. W vo cckn ts css by usn strntn colorn sttmnt (s Torm 6.) tt llows our mnml countrxmpl to not contn ny sprtn -cycls. Rucbl Conurtons In ts scton, w scrb structurs tt cnnot ppr n mnml countrxmpl to Torm 1.7. Lt G b rp, : V(G) N, n s b nonntv ntr. A rp s -coosbl G s L-coosbl or vry lst ssnmnt L wr L(v) (v). An (,s)-lst-ssnmnt s lst ssnmnt L on G suc tt L(v) (v) or ll v V(G), L(v) L(u) s or ll s uv E(G), n L(u) L(v) = uv E(G) n (u) = (v) = 1. A rp G s (,s)-coosbl G s L-colorbl or vry (, s)-lst-ssnmnt L. Dnton.1. A conurton s trpl (C,X,x) wr C s pln rp, X V(C), n x : V(C) {0,1,, } s n xtrnl r uncton. A rp G contns t conurton (C,X,x) C pprs s n nuc subrp C o G, n or c vrtx v V(C), tr r t most x(v) s n G rom t copy o v to vrtcs not n C. For trpl (C,X,x), n t lst-sz uncton : V(C) N s { 4 x(v) v X (v) = 1 v / X. A conurton (C,X,x) s rucbl C s (,)-coosbl. Not tt rp G wt (4,)-lst ssnmnt L contns copy o rucbl conurton (C,X,x) n G X s L-coosbl, tn G s L-coosbl. Frst, w not tt (C, X, x) s rucbl conurton, tn ny wy to n btwn stnct vrtcs o X n lowr tr xtrnl r by on rsults n notr rucbl conurton. 5
9 (C1) (C) (C) (C4) (C5) (C6) (C7) (C8) (C9) (C10) (C11) (C1) (C1) (C14) (C15) (C16) (C17) (C18) (C19) (C0) (C1) In ts conurtons, s wt only on npont r xtrnl s. Vrtcs n X r ll wt wt. Fur : Rucbl conurtons. 6
10 (C1) (C) (C4) (C5) (C10) (C11) (C1) (C1) (C14) (C15) (C16) Fur : Alon-Trs Ornttons. Lmm.. Lt (C,X,x) b rucbl conurton, n suppos tt x,y X r nonjcnt vrtcs wt { x(x),x(y) 1. Lt (C,X,x ) b t conurton wr C = C +xy, X = X, n x x(v) v / {x,y} (v) = x(v) 1 v {x,y},. Tn t conurton (C,X,x ) s rucbl. Proo. Lt b t lst-sz uncton or C n not tt C s (,)-coosbl. Smlrly lt b t lst-sz uncton on t conurton (C,X,x ), n lt L b n (,)-lst ssnmnt on V(C ). Not tt (x) = (x) + 1 n (y) = (y) + 1. Lt S = L (x) L (y). I S <, tn t most on lmnt rom c o L (x) n L (y) to S untl S =. Now lt S = {,b} suc tt L (x) n b L (y), n n lst ssnmnt L on C by rmovn rom L (x) n rmovn b rom L (y). Obsrv tt L s n (,)-lst ssnmnt n nc tr xsts n L-colorn o C. Snc L(x) L(y) =, ts propr L-colorn o C s lso n L -colorn o C. W wll us Lmm. mplctly by ssumn tt C[X] pprs s n nuc subrp n our mnml countrxmpl G..1 Rucblty Proos In ts scton, w prov tt conurtons (C1) (C1) sown n Fur r rucbl..1.1 Alon-Trs Torm W wll us t clbrt Alon-Trs Torm [1] to quckly prov tt mny o our conurtons r rucbl. In ct, conurtons tt r monstrt n ts wy r rucbl or 4-coosblty, not just (4, )-coosblty. A rp D s n orntton o rp G G s t unrlyn unrct rp o D n D s no -cycls; lt + D (v) n D (v) b t out- n n-r o vrtx v n D. An Eulrn subrp o rp D s subst S E(D) suc tt, or vry vrtx v V(D), t numbr o outon s o v n S s qul to t numbr o ncomn s o v n S. Lt EE(D) b t numbr o Eulrn subrps o vn sz n EO(D) b t numbr o Eulrn subrps o o sz. 7
11 Torm. (Alon-Trs Torm [1]). Lt G b rp n : V(G) N uncton. Suppos tt tr xsts n orntton D o G suc tt + D (v) (v) 1 or vry vrtx v V(G) n EE(D) EO(D). Tn G s -coosbl. W cll n orntton n Alon-Trs orntton t stss t ypotss o Torm.. For conurton (C,X,x) n t ssoct lst-sz uncton, t sucs to monstrt n Alon-Trs orntton o C wt rspct to. S Fur or lst o Alon-Trs ornttons o svrl conurtons. Corollry.4. T ollown conurtons v Alon-Trs ornttons n nc r rucbl: (C1), (C), (C4), (C5), (C10), (C11), (C1), (C1), (C14), (C15), (C16)..1. Drct Proos In t proos blow, w consr conurton (C,X,x) wt lst-sz uncton n ssum tt n (,)-lst-ssnmnt L s vn or C. W wll monstrt tt c C s L-colorbl. Rr to Fur or rwns o t conurtons. Frst rcll t ollown ct bout lst-colorn o cycls. Fct.5. I L s -lst ssnmnt o n o cycl, tn tr os not xst n L-colorn o t cycl n only ll o t lsts r ntcl. Lmm.6. (C) s rucbl conurton. Proo. Lt v 1,...,v 4 b t vrtcs o 4-cycl wt cor v v 4 n lt v n v 4 v xtrnl r 1; t colors c(v 1 ) n c(v ) r x. Ec o v n v 4 v t lst on color n tr lsts otr tn c(v 1 ) n c(v ). Snc L(v ) or c {,4}, tr on o ts vrtcs s t lst two colors vlbl, or L(v ) L(v 4 ) = {c(v 1 ),c(v )}. In tr cs, w cn xtn t colorn. For t conurtons (C6), (C7), n (C8), lbl t vrtcs s n Fur 4: lbl t cntr vrtx v 0 n t outr vrtcs v 1,...,v 5, strtn wt t vrtx rctly bov v 0, movn clockws. v 1 v 1 v 1 v 5 v v 5 v v 5 v v 0 v 0 v 0 v 4 v v 4 v v 4 v (C6) (C7) (C8) Fur 4: Vrtx lbls or conurtons (C6), (C7), n (C8). Lmm.7. (C6) s rucbl conurton. 8
12 Proo. T colors c(v 1 ) n c(v 4 ) r trmn. I c(v 1 ) n c(v 4 ) r bot n L(v 0 ), tn slct c(v 5 ) rom L(v 5 )\(L(v 0 ) {c(v 1 ),c(v 4 )}); otrws, slct c(v 5 ) L(v 5 )\{c(v 1 ),c(v 4 )} rbtrrly. Dn L (v 0 ) = L(v 0 )\{c(v 1 ),c(v 4 ),c(v 5 )}, L (v ) = L(v )\{c(v 1 )}, n L (v ) = L(v )\{c(v 4 )} n not tt L (v ) or ll {0,,}. I L (v 0 ) = L (v ) =, tn L (v 0 ) L (v ), so t -cycl v 0 v v s n L -colorn by Fct.5. Lmm.8. (C7) s rucbl conurton. Proo. I tr xsts color L(v 1 ) L(v 4 ), strt by ssnn c(v 1 ) = c(v 4 ) = ; tn rly color t rmnn vrtcs n t ollown orr: v,v,v 0,v 5. Otrws, L(v 4 ) L(v 1 ) =. Suppos tt L(v 1 ) L(v 5 ) =. Slct color c(v 4 ) L(v 4 ). Consrn v 4 s n xtrnl vrtx n norn t v 1 v 5, t 4-cycl v 0 v 1 v v orms copy o (C4), wc s rucbl by Corollry.4. Tus, tr xsts n L-colorn o v 0,...,v 4 ; ts colorn xtns to v 5 snc L(v 1 ) L(v 5 ) =. I L(v 4 ) L(v 5 ) =, tn tr xsts n L-colorn by symmtrc rumnt. Otrws, tr xst colors L(v 1 ) \ L(v 5 ) n b L(v 4 ) \ L(v 5 ); ssn c(v 1 ) = n c(v 4 ) = b. Slct c(v ) L(v )\{c(v 1 )}. Dn L (v 0 ) = L(v 0 )\{c(v 1 ),c(v ),c(v 4 )} n L (v ) = L(v )\{c(v ),c(v 4 )}. Not tt L (v 0 ) = L (v ) = 1, tn L(v 0 ) L(v ) = {c(v ),c(v 4 )} n nc L (v 0 ) L (v ) =. Tus, t colorn xtns by rly colorn v, v 0, n v 5. Lmm.9. (C8) s rucbl conurton. Proo. I L(v 1 ) L(v ) =, tn rly color v n v ; wt rmns s (C4) n t colorn xtns. A smlr rumnt works L(v ) L(v ) =. I L(v 1 ) L(v ) =, tn L(v 1 ) L(v ) = L(v ) L(v ) = 1. Slct c(v 1 ) L(v 1 )\L(v ), c(v ) L(v )\L(v ). Dn L (v 0 ) = L(v 0 )\{c(v 1 ),c(v )}, L (v 4 ) = L(v 4 )\{c(v )}, n L (v 5 ) = L(v 5 ) \ {c(v )}. Obsrv tt w cn L -color t -cycl v 0 v 4 v 5 by Fct.5 n tn slct c(v ) L(v )\{c(v 0 )}. I tr xsts color L(v 1 ) L(v ), strt by ssnn c(v 1 ) = c(v ) = n tn ssn c(v ) L(v )\{}. DnL (v 0 ) = L(v 0 )\{,c(v )}, L (v 4 ) = L(v 4 )\{}, nl (v 5 ) = L(v 5 )\{}. Obsrv tt t -cycl v 0 v 4 v 5 s n L -colorn by Fct.5. Lmm.10. (C9) s rucbl conurton. Proo. Consr t vrtx v o rbtrry xtrnl r n lt c(v) b t color ssn to v. Lt u 1 n u b t two nbors o v n t conurton. I w rmov c(v) rom t lsts on u 1 n u, obsrv tt t lst two colors rmn n vry lst or vry vrtx o t 5-cycl. I tr s no L-colorn o t conurton, tn Fct.5 ssrts tt ll lsts v sz two n contn t sm colors; owvr, ts mpls tt L(u 1 ) = L(u ) n L(u 1 ) L(u ) =, contrcton..1. Tmplt Conurtons T conurtons (C17) (C1) r spcl css o nrl constructons cll tmplt constructons. Lt (C,X,x) b conurton wt vrtcs u,v X. A uv-pt P s cll spcl uv-pt ll ntrnl vrtcs o P v r two n C n xtrnl r two. A uv-pt P s cll n xtr-spcl uv-pt ll ntrnl vrtcs o P v xtrnl r two n r two n C, xcpt or conscutv pr xy wr x(x) = x(y) = 1, (x) = (y) =, n tr s vrtx 9
13 z / X suc tt z s common nbor to x n y, n z s not jcnt to ny otr vrtcs n C. Usn ts spcl n xtr-spcl pts, w cn scrb svrl conurtons by t ollown tmplts (s Fur 5), consstn o (B1) trnl uvw, wr x(u) = x(w) =, x(v) = 0, n xtr-spcl uv-pt P 1, n spcl vw-pt P, n (B) trnl vwr, wr x(r) =, x(w) = 1, x(v) = 0, vrtx u jcnt to v wr x(u) =, n xtr-spcl uv-pt P 1, n spcl vw-pt P. z P 1 x y u v (B1) w P P 1 x u z r y v (B) Dott lns nct spcl pts or xtr-spcl pts. Vrtcs n X r ll wt wt. Fur 5: Tmplts or rucbl conurtons. W mk som bsc obsrvtons bout spcl n xtr-spcl pts tt wll b us to prov tt ts tmplts corrspon to rucbl conurtons. Lt P b spcl uv-pt or n xtr-spcl uv-pt. For vry color L(u), lt P u () b t st contnn c color b L(v) suc tt ssnn c(u) = n c(v) = b os not xtn to n L-colorn o P. Snc w cn rly color P strtn t u untl rcn v, tr s t most on color n P u(). Furtr, u P () n only ts ry colorn procss s xctly on coc or c vrtx n P. Tus, P u() = {b} tn lso v P (b) = {}. Snc L s n (,)-lst ssnmnt, jcnt vrtcs v t most two colors n common. Tus, tr r t most two colors 1, L(u) suc tt P u( ). Morovr, obsrv tt tr r two stnct colors 1, L(u) suc tt P u( ), tn bot 1 n r n vry lst lon P n nc { 1, } L(v). I P s n xtr-spcl uv-pt wt -cycl xyz wr xy s n t pt P, tn tr color s ssn to z (s x(z) = ) tr on o x or y s tr colors vlbl or L(x) L(y) 1. Tror, P s n xtr-spcl uv-pt, tn tr s t most on color L(u) suc tt P u (). Lmm.11. All conurtons mtcn t tmplt (B1) r rucbl. Proo. Lt (C,X,x) b conurton mtcn t tmplt (B1) n lt L b n (,)-lst ssnmnt. Lt L(u) = { 1, }. Snc P 1 s n xtr-spcl pt, tr s t lst on {1,} suc tt u P 1 ( ) =. Assnc(u) =, slct c(w) L(w)\{ }nc(v) L(v)\ ( {c(u),c(w)} w P 1 (c(w)) ) ; t colorn xtns to P 1 n P. w P 10
14 Corollry.1. T conurtons (C17), (C18), n (C19) mtc t tmplt (B1), n nc ty r rucbl. Lmm.1. All conurtons mtcn t tmplt (B) r rucbl. Proo. Lt (C,X,x) b conurton mtcn t tmplt (B) n lt L b n (,)-lst ssnmnt. Lt c(r) b t unqu color n t lst L(r). Lt L(u) = { 1, }. Snc P 1 s n xtr-spcl pt, tr s t lst on {1,} suc tt u P 1 ( ) =. Assn c(u) =. I c(r) / L(v), tn slct c(w) L(w), n L(v) L(v) \ ( {c(u),c(w)} w P (c(w)) ) ; t colorn xtns to P 1 n P. I c(r) L(v), tn slct c(w) L(w) \ L(v); obsrv c(w) c(r). Tr xsts color c(v) L(v)\ ( {c(r),c(u)} w P (c(w)) ) ; t colorn xtns to P 1 n P. Corollry.14. Usn Lmm., t conurtons (C0) n (C1) mtc t tmplt (B), n nc ty r rucbl. 4 No Cor 5-Cycl In ts scton w sow t cs o orbn cor 5-cycls rom Torm 1.7. Torm 4.1. I G s pln rp not contnn cor 5-cycl, tn G s (4,)-coosbl. Proo. Lt G b countrxmpl mnmzn n(g) mon ll pln rps von cor 5- cycls wt (4,)-lst ssnmnt L suc tt G s not L-coosbl. Obsrv tt n(g) 4; n ct, δ(g) 4. Snc G s mnml countrxmpl, G os not contn ny o t rucbl conurtons (C9) (C1). I (C, X, x) s rucbl conurton, tn by Lmm. C os not ppr s subrp o G wr G (x) C (x) + x(x) or ll x V(C). Furtr, t conurtons (C1) (C1) r lr nou tt w must consr conurtons tt r orm by ntyn crtn prs o vrtcs n ts conurtons. In Appnx A, w concrtly cck ll vrtx prs tt vo crtn cor 5-cycl n n tt ll rsultn conurtons r rucbl. For c v V(G) n F(G) n ntl crs µ(v) = (v) 6 n ν() = l() 6. By Eulr s Formul, t sum o ntl crs s 1. Atr crs r ntlly ssn, t only lmnts wt ntv cr r 4-vrtcs n 5-vrtcs. Snc cor 5-cycls r orbn, tr s no -n n G n vry 4-c s jcnt to only 4 + -cs. T possbl rrnmnts o -, 4 + -, or 5 + -cs ncnt to 4- n 5-vrtcs r sown n Fur 6. Squntlly pply t ollown scrn ruls. Not tt, or vrtx v n c, w n µ (v) n ν () to b t cr on v n, rspctvly, tr pplyn rul (R). (R1) Lt v b 4-vrtx n b 4 + -c ncnt to v. I s jcnt to -c tt s lso ncnt to v, tn sns cr 1 to v; otrws, sns cr 1 to v. (R) Lt v b 5-vrtx. I s 4 + -c ncnt to v, tn sns cr 1 to v. A c s ny c ν () < 0; otrws, s non-ny. (R) I v s 5-vrtx ncnt to ny 5-c, tn v sns cr 1 to. 11
15 v v v v () (b) (c) () v v v v v () () () () () Fur 6: Possbl cyclc rrnmnts o -, 4 + -, n 5 + -cs ncnt to 4- n 5-vrtcs A vrtx v s ny vrtx µ (v) < 0; otrws, v s non-ny. (R4) I s non-ny 5 + -c ncnt to ny 5-vrtx v, tn sns cr 1 to v. W sow tt µ 4 (v) 0 or c vrtx v n ν 4 () 0 or c c. Snc t totl cr ws prsrv urn t scrn ruls, ts contrcts t ntv cr sum rom t ntl cr vlus. W bn by consrn t cr strbuton tr pplyn (R1) n (R). Lt v b vrtx. I v s 4-vrtx, tn µ(v) = n v rcvs totl cr t lst rom ts nborn cs by (R1). Furtrmor, v s not ct by ny ruls tr (R1), so µ 4 (v) 0. I v s 6 + -vrtx, tn µ(v) 0 n v s not ct by ny otr ruls, so µ 4 (v) 0. I v s 5-vrtx, tn µ(v) = 1 n v rcvs totl cr t lst 1 rom ts nborn cs by (R). Tror, or ny vrtx v, µ (v) 0. Lt b c. I s -c, tn ν() = 0 n s not ct by ny rul, so ν 4 () = 0. I s 4-c, tn ν() =. In (R1) n (R), t only cs tt sn cr 1 to snl vrtx r jcnt to -c. A 4-c jcnt to -c s cor 5-cycl, wc s orbn by ssumpton, so sns cr t most 1 to c vrtx. Snc 4-cs r not ct by ruls (R) (R4), ν 4 () 0. I s 6 + -c, tn s t lst s muc ntl cr s t s ncnt vrtcs. I v s 4-vrtx ncnt to, tn sns cr t most 1 to v by (R1) n os not sn ny cr to v by ruls (R) (R4). I v s 5-vrtx ncnt to, tn sns cr 1 to v by (R1), n possbly notr cr 1 by (R4), n os not sn cr to v by (R1) or (R). Tus sns cr t most 1 to c ncnt vrtx, n ν 4 () 0. I s 5-c, tn ν() = 4 n sns cr t most 1 to c ncnt vrtx by (R1) n (R). Obsrv tt ν () = 1, tn s ncnt to v 4-vrtcs n s jcnt to t lst on -c; ts orms (C9), contrcton. Tror, w v t ollown clm bout t structur o ny 5-vrtx. Clm 4.. I s ny 5-c, tn ν () = 1 n s jcnt to xctly on 5-vrtx. W now consr t cr strbuton tr pplyn (R). I s ny 5-c, tn ν () = 1 n s jcnt to xctly on 5-vrtx, so ν () = 0. No cs los cr n (R), tror ν () 0 or ny c. 1
16 Clm 4.. I v s ny 5-vrtx, tn v s ncnt to tr -cs, two 4 + -cs, n xctly on ny 5-c; nc µ (v) = 1. Proo. Suppos tt v s vrtx suc tt µ (v) < 0, n consr t cyclc rrnmnt o - n 4 + -cs bout v. Cs 1: v s ncnt to t lst our 4 + -cs (Furs 6() n 6()). Snc µ (v) 1 n µ (v) < 0, v s ncnt to t lst tr ny 5-cs. Hnc two o t ny 5-cs r jcnt, ormn (C1), contrcton. Cs : v s ncnt to two non-jcnt -cs n tr 4 + -cs (Fur 6()). Sncµ (v) = 1 n µ (v) < 0, v s ncnt to two ny 5-cs, 1 n. I ts two cs r jcnt, tn ty orm (C1), contrcton. Otrws, ty sr -c t s nbor n ll vrtcs ncnt to 1,, n t otr tn v r 4-vrtcs, so t vrtcs ncnt to 1 n t orm (C10), contrcton. Cs : v s ncnt to two jcnt -cs n tr 4 + -cs (Fur 6()). Snc µ (v) = 1 n µ (v) < 0, v s ncnt to two ny 5-cs, 1 n. I 1 n r jcnt tn ty orm (C1), contrcton. Tus, 1 n r not jcnt, but ty r c jcnt to -c ncnt to v. Snc s ny or c {1,}, snt cr 1 to vry 4-vrtx ncnt to. By (R1), vry 4-vrtx ncnt to s ncnt to -c jcnt to. Tror, 1 s jcnt to -c tt os not sr ny vrtcs wt t t two -cs ncnt to v, ormn on o (C0) or (C1), contrcton. Cs 4: v s ncnt to tr -cs n two 4 + -cs (Fur 6()). I v s ncnt to two ny 5-cs 1 n, tn t -c t jcnt to bot 1 n s ncnt to two 4-vrtcs, n t vrtcs ncnt to 1 n t orm (C10), contrcton. Tror, v s ncnt to xctly on ny 5-c, s clm. By (R4), vry ny 5-vrtx rcvs cr 1 rom ts unqu ncnt non-ny 5+ -c, so µ 4 (v) 0 or vry vrtx v. Ec ny 5-c s nonntv cr tr (R), so ν 4 () < 0 or som 5-c, tn sns cr by (R4), n tus s non-ny. b 1 t 1 t v 1 t v 5 v 4 v v +1 u t v +1 v +1 u t v +1 v w () A 5-c wt ν 4() < 0. (b) Clm 4.5, Cs 1. (c) Clm 4.5, Cs. Fur 7: Spcl css or 5-c wt ν 4 () < 0. 1
17 Consr t Fur 7(), wr s 5-c wt ν 4 () < 0, s ncnt to vrtcs v 1,...,v 5, v 1 s ny 5-vrtx, n 1 s t ny 5-c ncnt to v 1. Lt t 1 n t b t jcnt pr o -cs ncnt to v 1 wt t 1 jcnt to 1 n t jcnt to ; lt t b t otr -c ncnt to v 1. W mk two bsc clms bout ts rrnmnt. Clm 4.4. T vrtx v jcnt to v 1 n ncnt to t s 5 + -vrtx. Proo. I v s 4-vrtx, tn t vrtcs ncnt to 1 n t orm (C10), contrcton. Clm 4.5. I v n v +1 r conscutv vrtcs on t borr o, tn t most on o v n v +1 s ny. Proo. Suppos tt two conscutv vrtcs v n v +1 r ny 5-vrtcs. Lt n +1 b t ny 5-cs ncnt to v n v +1, rspctvly. Snc bot v n v +1 v tr ncnt -cs, s jcnt to -c t cross t v v +1. Lt u b t tr vrtx ncnt to t n consr two css. Cs 1: t s not n mon (Fur 7(b)). Snc s ny, t vrtx jcnt to u n ncnt to (wt v ) s 4-vrtx n s ncnt to -c t suc tt t s jcnt to. T vrtcs ncnt to, +1, t, n t orm on o (C15) or (C19), contrcton. Cs : t s n mon (Fur 7(c)). Lt w b t ourt vrtx n t mon n ssum, wtout loss o nrlty, tt v s jcnt to w. Lt b b t vrtx ncnt to +1 tt s not jcnt to u or v +1 lon t bounry o +1 ; snc +1 s ny, tr s -c t +1 ncnt to b n jcnt to +1. T vrtcs v n w n tos ncnt to +1 n t +1 orm on o (C17) or (C18), contrcton. By Clm 4.5, s ncnt to t most two ny vrtcs, n by Clm 4.4, v s non-ny. I s ncnt to xctly on ny 5-vrtx, tn v,v 4, n v 5 r 4-vrtcs snc µ () = 0, but tn t vrtcs ncnt to n 1 orm (C14), contrcton. Tror, s ncnt to two ny vrtcs, nsnc v s 5 + -vrtx, s ncnt toxctly two 4-vrtcs. Ec o ts rcvs cr 1, so ν 4 () = 1. By Clm 4.5, t ny vrtcs ncnt to consst o v 1 n xctly on o v or v 4. T ny 5-vrtx v otr tn v 1 s lso ncnt to tr -cs t 4,t 5, n t 6, wr t 4 n t 5 orm mon wt t 4 jcnt to. By Clm 4.4, t vrtx jcnt to v n ncnt to bot n t 6 s non-ny 5 + -vrtx. T only non-ny 5 + -vrtx ncnt to s v, n nc v s ny 5-vrtx n t 4 s ncnt to v 4. I v s 6 + -vrtx, tn ν 4 () 0. Tror, tr s unqu rrnmnt o ny vrtcs, 4-vrtcs, n 5-vrtx bout 5-c wt ν 4 () < 0 (Fur 8). For {1,}, lt b t ny 5-c ncnt to t ny 5-vrtx v. T vrtcs ncnt to, 1,, t, n t 6 orm (C16), so ts rrnmnt os not ppr wtn G; nc ν 4 () 0 or ll 5-cs. Tror, vry vrtx n c s nonntv cr tr (R4), contrctn t ntv ntl cr sum. Tus, mnml countrxmpl os not xst n vry pln rp wt no cor 5-cycl s (4, )-coosbl. 14
18 v 5 v 4 t t 4 t 1 t 5 v 1 v 1 v t t 6 Fur 8: A non-ny 5-vrtx v ncnt to non-ny 5-c wt ν 4 () < 0. 5 No Cor 6-Cycl In ts scton w sow t cs o orbn cor 6-cycls rom Torm 1.7. T cs o orbn oubly-cor 6- n 7-cycls ollows rom vry smlr rumnt. W v t ull proo or no cor 6-cycls n scrb t rncs or t proo wn w orb oublycor 6- n 7-cycls. Torm 5.1. I G s pln rp not contnn cor 6-cycl, tn G s (4,)-coosbl. Proo. Lt G b countrxmpl mnmzn n(g) mon ll pln rps von cor 6- cycls wt (4,)-lst ssnmnt L suc tt G s not L-coosbl. Obsrv tt n(g) 5; n ct, δ(g) 4. Snc G s mnml countrxmpl, G os not contn ny o t rucbl conurtons. Spcclly, w us t ct tt G vos (C) n (C4) (s Fur ). For c v V(G) n F(G) n ntl cr µ(v) = (v) 4 n ν() = l() 4. By Eulr s Formul, t ntl cr sum s 8. Snc δ(g) 4, t only lmnts o ntv cr r -cs. Snc cor 6-cycl s orbn n δ(g) 4, t clustrs (s Fur 1) r trnls (K), mons (K4), -ns (K5), 4-wls (K5b), n 4-ns wt n vrtcs nt (K5c). Spcclly not tt t 4-n (K6b) contns cor 6-cycl, so t most tr -cs n clustr sr common vrtx, unlss ty orm 4-wl (K5b) n t common vrtx s t 4-vrtx n t cntr o t wl. Apply t ollown scrn ruls, s sown n Fur 9. (R1) I s -c n s n ncnt, tn lt b t c jcnt to cross. (R1) I s 5 + -c, tn pulls cr 1 rom trou t. (R1b) I s 4-c, tn lt 1,, n b t otr s ncnt to. For c {1,,}, lt b t c jcnt to cross. For c {1,,}, t c pulls cr 1 9 rom t c trou t s n. (R) Lt v b 5 + -vrtx, n lt b n ncnt -c. (R) I v s 5-vrtx, tn v sns cr 1 (Rb) I v s 6 + -vrtx, tn v sns cr 4 9 to. to. (R) I X s clustr, tn vry -c n X s ssn t vr cr o ll -cs n X. 15
19 (R1) (R1b) (R) (Rb) v 1 v 4 9 Fur 9: Dscrn ruls n t proo o Torm 5.1. Notc tt t ruls prsrv t sum o t crs. Lt µ (v) n ν () not t cr on vrtx v or c tr rul (R). W clm tt µ (v) 0 or vry vrtx v n ν () 0 or vry c ; snc t totl cr sum s prsrv by t scrn ruls, ts contrcts t ntv cr sum rom t ntl cr vlus. Lt v b vrtx. I v s 4-vrtx, tn v s not nvolv n ny rul, so t rsultn cr s 0. I v s 6 + -vrtx, tn by (Rb) v loss cr 4 9 to c ncnt -c. Snc G vos cor 6-cycls, v s ncnt to t most 4 (v) -cs. Tus µ (v) stss µ (v) (v) (v) (v) (v) = (v) 4 0. I v s 5-vrtx, tn by (R) v loss cr 1 6-cycls, v s ncnt to t most tr -cs, so to c ncnt -c. Snc G vos cor µ (v) (v) 4 1 = (v) 5 = 0. Tror, µ (v) 0 or vry vrtx v. Lt b c. Snc 4-cs r not jcnt to 4-cs, (R1b) os not ct t cr vlu on 4-cs. Tus, ν () = 0 or vry 4-c. I s 6 + -c, tn loss cr t most 1 trou c by (R1) or (R1b), so ν () l() 4 1 l() = l() 4 0. Tror, ν () 0 or vry 6 + -c. Lt b5-c. Snc G contns no cor 6-cycls, s not jcnt to -c. Tror, loss no cr by (R1), but coul los cr usn (R1b), so ν () l() l() = 8 l() Tror, ν () 0 s5-c. Allobjctsttstrtwtnonntvcrvnonntv cr tr t scrn procss. It rmns to sow tt c clustr o -cs rcvs nou cr to rsult n nonntv cr sum. 16
20 Cs 1: (K) Lt b n solt -c. T tr jcnt cs 1,, n r ll 4 + -cs. By (R1) or (R1b), rcvs cr 1 trou c ncnt, so ν () = 1+ 1 = 0. Cs : (K4) Lt 1 n b -cs n mon clustr (K4). Tn 1 s jcnt to two 4 + -cs 1 n, n s jcnt to two 4 + -cs 1 n. By (R1) or (R1b), t clustr rcvs cr 1 trou c o t our s on t bounry o t mon. Snc ν( 1 )+ν( ) =, t cr vlu on t mon tr rul (R1) s. Snc G contns no (C), tr s 5 + -vrtx v ncnt to bot 1 n. I v s 5-vrtx, tn by (R), 1 n c rcv cr 1, n t rsultn cr on t mon s zro. I v s 6+ -vrtx, tn by (Rb), 1 n c rcv cr 4 9, n t rsultn cr on t mon s postv. Cs : (K5) Lt 1,, n b -cs n -n clustr (K5), wr s jcnt to bot 1 n. T ntl cr on ts clustr s. Tr r v s on t bounry o ts clustr, so by (R1) t clustr rcvs cr 5, rsultn n cr 4 tr (R1). Not tt t c s jcnt to bot 1 n. Snc G contns no (C), tr xsts 5 + -vrtx v ncnt to bot 1 n, n tr xsts 5 + -vrtx u ncnt to bot n. I v u, tn by (R) v sns cr t lst 1 to c o 1 n n u sns cr t lst 1 to c o n, rsultn n nonntv cr on t -n. I v = u n v s 6 + -vrtx, tn by (Rb) v sns cr 4 9 to c c 1,, n, rsultn n nonntv cr on t -n. Otrws, suppos tt v = u n v s 5-vrtx. Snc G contns no (C4), tr xsts notr 5 + -vrtx w ncnt to t lst on o 1 n. By (R) v sns cr 1 to c o 1,, n, n by (R) w sns cr t lst 1 to t lst on o 1 n, rsultn n nonntv cr on t -n. Cs 4: (K5b) Lt 1,,, n 4 b -cs n 4-wl (K5b). T ntl cr on ts clustr s 4. Trrours on tbounryo ts clustr, so by(r1) tclustr rcvs cr 4, rsultn n cr 8 tr (R1). Lt v b t 4-vrtx ncnt to ll our -cs. Lt u 1, u, u, n u 4 b t vrtcs jcnt to v, orr cyclclly suc tt vu u +1 s t bounry o t -c or {1,,} n vu 4 u 1 s t bounry o 4. Snc G contns no (C) n (v) = 4, c u s 5 + -vrtx. By (R), c u sns cr t lst to t clustr, rsultn n nonntv totl cr. Cs 5: (K5c) Lt 1,,, n 4 b -cs n 4-strp wt nt vrtcs s n (K5c). T ntl cr on ts clustr s 4. Lt v, u 1, u, u, n u 4 b t vrtcs n t 4-strp, wr v s ncnt to only 1 n 4, u 1 s ncnt to only 1 n, u s ncnt to,, n 4, u s ncnt to 1,, n, n u 4 s ncnt to only n 4. Tr r sx s on t bounry o ts clustr, so by (R1) t clustr rcvs cr 6, rsultn n cr = tr (R1). 6 Snc n orm mon, n G contns no (C), on o u n u s 5 + -vrtx. Wtout loss o nrlty, ssum u s 5 + -vrtx. Snc n 4 orm mon, n G contns no (C), on o u n u 4 s 5 + -vrtx. I u s 5 + -vrtx, tn by (R), t clustr rcvs cr t lst + rom u n u, wc rsults n nonntv totl cr. Otrws, u s 4-vrtx n u 4 s 5 + -vrtx. I u s 6 + -vrtx, tn by (R), t clustr rcvs cr t lst 4 + rom u n u 4. I u s 5-vrtx, tn snc 1 n orm mon n G contns no (C4), on o v n u 1 s 5 + -vrtx. By (R), t clustr rcvs 17
21 cr t lst + + rom u n u 4 n on o v n u 1. In tr cs, t nl cr s nonntv. W v vr tt t totl cr tr scrn s nonntv, contrctn t ntv ntl cr sum. Tus, mnml countrxmpl os not xst n vry plnr rp wt no cor 6-cycl s (4, )-coosbl. Corollry 5.. I G s pln rp not contnn oubly-cor 6-cycl or oubly-cor 7-cycl, tn G s (4, )-coosbl. Proo. Lt G b mnml countrxmpl by mnmzn n(g). Obsrv tt n(g) 4 n δ(g) 4. Snc G contns no oubly-cor 6-cycl, t clustrs r -cs (K), mons (K4), -ns (K5), 4-wls (K5b), n 4-ns wt n vrtcs nt (K5c). Us t sm scrn rumnt s n Torm 5.1, wt t ollown cns: I s 4-c, tn cn b jcnt to 4-c. Howvr, snc G contns no oublycor 7-cycl, cnnot b jcnt to -c. Tror, os not los cr by rul (R1b). I s 5-c, tn cn b jcnt to t most on -c, snc G contns no oublycor 7-cycl. By (R1) loss cr 1 cross t t srs wt, n by (R1b) loss cr t most 1 9 cross t otr our s. Tus ν () l() = 9 0. All o t otr rumnts rom t proo o Torm 5.1 ol, wc sows tt t rsultn totl cr s nonntv, n nc mnml countrxmpl os not xst. 6 No Cor 7-Cycl Torm 6.1. I G s pln rp not contnn cor 7-cycl, tn G s (4,)-coosbl. W prov t ollown strntn sttmnt: Torm 6.. Lt G b plnr rp wt no cor 7-cycl, n lt P b subrp o G, wr P s somorpc to on o P 1,P,P, or K, n ll vrtcs n V(P) r ncnt to common c. Lt L b (4,)-lst ssnmnt o G P n lt c b propr colorn o P. Tr xsts n xtnson o c to propr colorn o G suc tt c(v) L(v) or ll v V(G P). Proo. Suppos tt tr xsts countrxmpl. Slct countrxmpl (G, P, L, c) by mnmzn n(g) 1 4n(P) mon ll cor 7-cycl r pln rps, G, wt subrpp somorpc to rp n {P 1,P,P,K }, propr colorn c o P, n (4,)-lst ssnmnt L o G P suc tt c os not xtn to n L-colorn o G. W wll rr to t vrtcs o P s prcolor vrtcs. Clm 6.. G s -connct. 18
22 Proo. I G s sconnct, tn c connct componnt cn b color sprtly. Suppos tt G s cut-vrtx v. Tn tr xst connct subrps G 1 n G wr G = G 1 G n V(G 1 ) V(G ) = {v}, n(g 1 ) < n(g), n n(g ) < n(g). W cn ssum wtout loss o nrlty tt G 1 contns t lst on vrtx o P, so lt S 1 b t subrp o P contn n G 1. I G contns t lst on vrtx o P,.., v S 1, tn lt S b t subrp o P contn n G ; otrws, lt S b t vrtx v. Snc (G,P,L,c) s mnml countrxmpl, tr s n L-colorn c 1 o G 1 tt xtns t colorn on S 1. Usn t color prscrb by c 1 on v, tr xsts n L-colorn c o G tt xtns t colorn on S. T colorns c 1 n c orm n L-colorn o G, contrcton. Clm 6.4. G s no sprtn -cycls. Proo. Suppos tt P = v 1 v v s sprtn -cycl o G. Lt G 1 b t subrp o G vn by t xtror o P lon wt P, n lt G b t subrp o G vn by t ntror o P lon wt P. Snc P s sprtn, n(g 1 ) < n(g) n n(g ) < n(g). Snc t vrtcs n P sr common c, w cn ssum wtout loss o nrlty tt V(P) V(G 1 ). Snc (G,P,L,c) s mnml countrxmpl, tr xsts n L-colorn c 1 o G 1. Assn t colors rom c 1 to P. Tn tr xsts n L-colorn o G xtnn t colors on P, n totr c 1 n c orm n L-colorn o G, contrcton. Clm 6.5. I v V(P) suc tt V(P) N[v], tn t subrp o G nuc by N(v) s not somorpc to ny rp n {P 1,P,P,K }. Proo. Suppos tt tr xsts vrtx v V(P) wr ll prcolor vrtcs r n N[v] n t subrp G[N(v)] s somorpc to subrp n {P 1,P,P,K }. Tn consr t rp G = G v wt subrp P = G[N(v)]. Snc N G [v] 4, tr xsts n L-colorn c o G[N[v]]. Snc (G,P,L,c) s mnml countrxmpl, c xtns to n L-colorn o G, wc n turn xtns to n L-colorn o G, contrcton. Clm 6.6. I v V(P) s G (v), tn G (v) = n P s somorpc to P 1, P, or P. Proo. By Clm 6., G (v) 1. I G (v) = n P = K, tn G[N G (v)] s somorpc to P, contrctn Clm 6.5. Clm 6.7. P s somorpc to on o P or K. Proo. Suppos tt P s not somorpc to tr P or K. I P s somorpc to P 1, tn t vrtx o P s two conscutv nbors u 1 n u not n P; lt U = {u 1,u }. I P s somorpc to P, tn som vrtx v n P s nbor u 1 not n P tt srs c wt t n P; lt U = {u 1 }. Lt P b t subrp somorpc to P or K vn by nclun vrtcs n U. Tr xsts propr colorn c o P tt xtns t colorn on P. But tn (G,P,L,c ) s n(g) 1 4 n(p ) < n(g) 1 4n(P), so tr xsts n L-colorn o G tt xtns c, contrcton. Clm 6.8. I v V(G P), tn G (v) 4. 19
23 Proo. Suppos tt v V(G P) s r (v). Tn G v s plnr rp wt no cor 7-cycl contnn prcolor subrp P n lst ssnmnt L. Snc (G,P,L,c) s mnmum countrxmpl, G v s n L-colorn. Howvr, v s t most tr nbors n t lst our colors n t lst L(v). Tus, tr s n xtnson o t L-colorn o G v to n L-colorn o G, contrcton. Obsrv tt n(g) 4. Rcll tt n conurton (C,X,x), n L-colorn o V(C) \ X xtns to ll o C. Bcus o ts ct, G contns rucbl conurton (C,X,x), tn tr s prcolor vrtx n t st X, or ls G X s n L-colorn tt xtns to ll o G. Spcclly, w wll us t ct tt G vos (C), (C), (C4), (C5), (C6), (C7), n (C8). For c v V(G) n F(G) n µ(v) = (v) 4+δ(v) n ν() = l() 4+ε(), wr δ(v) {0,1} s vlu 1 n only v V(P), n ε() {0,1} s vlu 1 n only t bounry o s t st o prcolor vrtcs, V(P). By Eulr s Formul, t ntl cr sum s t most 1. Clms 6.6 n 6.8 ssrt tt t only ntvly-cr objcts r -cs. For vrtx v, lt t k (v) not t numbr o k-cs ncnt to v. Apply t ollown scrn ruls. Lt µ (v) n ν () not t cr on vrtx v or c tr rul (R). 8 v 1 v 4 9 (R1) (R) (Rb) (R1b) (R1c), Cs 1 (R1c), Cs Fur 10: Dscrn ruls (R1) n (R) n t proo o Torm 6.1. (R0) I v s prcolor vrtx n s n ncnt -c wt ntv cr, tn v sns cr 1 to. (R1) I s -c n s n ncnt, tn lt b t c jcnt to cross. 0
24 (R1) I s 5 + -c, tn pulls cr 8 rom trou t. (R1b) I s 4-c n s t only -c jcnt to, tn lt 1,, n b t otr s ncnt to. For c {1,,}, lt b t c jcnt to cross. For c {1,,}, t c pulls cr 1 8 rom t c trou t s n. (R1c) I s 4-c n s jcnt to two -cs 1 n (sy 1 = ), tn lt 1 n b t otr s ncnt to, wr t cs 1 n srn ts s r 6 + -cs. For c {1,}, t c pulls cr 16 rom t c trou t s n. (R) Lt v b 5 + -vrtx wt v / V(P) n lt b n ncnt -c. (R) I v s 5-vrtx, tn v sns cr 1 to, wn = mx{,t (v)}. (Rb) I v s 6 + -vrtx, tn v sns cr 1 (R) I s 6-c wt ν () < 0 n v s n ncnt 5 + -vrtx or n ncnt vrtx n V(P) wt µ 0 (v) > 0, tn v sns cr 1 4 to. W clm tt µ (v) 0 or vry vrtx v n ν () 0 or vry c. Snc t totl cr sum ws prsrv urn t scrn ruls, ts contrcts t ntv cr sum rom t ntl cr vlus. Not tt 6-cs r not ncnt to -cs snc G os not contn cor 7-cycl. Obsrv tt 6-c s ν 1 () < 0 n only ll cs jcnt to r 4-cs, n c o tos 4-cs s two jcnt -cs. Clm 6.9. Lt v b vrtx n V(P). Tn µ (v) 0. In ton, v s ncnt to 6-c wt ν 1 () < 0, tn µ 0 (v) > 0. Proo. By Clms 6.6 n 6.7, w v µ(v) = (v) 0. Not tt µ(v) 1 t (v) t 6(v), tn t nl cr µ (v) s nonntv. Snc (v) t (v) + t 6 (v), t sucs to sow tt µ 0 (v) 1 4 (v)+ 1 4 t (v). Cs 1: P = P. Lt v 1, v, n v b t vrtcs n t -pt P. For {1,,}, µ(v ) = (v ). Snc P s not somorpc to K, ts vrtcs o not orm cycl, n t c to wc ll vrtcs r ncnt s not -c. Hnc t (v ) (v ) 1. I (v ) 4, tn µ(v ) = (v ) 1 (v ) > 1 4 (v )+ 1 4 t (v ). to. I (v ) =, tn µ(v ) = 0. I =, tn v s not ncnt to ny -cs snc v 1 n v r not jcnt. I {1,} n v s jcnt to -c, tn lt v b t nbor o v not n V(P). Lt P b t subrp nuc by (V(P) {v }) \{v }, wc orms copy o P or K n G v. For ny color c(v ) L(v ) \ {c(v )}, tr xsts n L-colorn o G v s (G v,p,l,c) s not countrxmpl; ts colorn xtns to n L-colorn o G. Tus, t (v ) = 0. I v s ncnt to 6-c wt ν 1 () < 0, tn t otr c ncnt to v s 4-c tt s jcnt to two -cs. Ts rsults n cor 7-cycl, contrcton; tus (R) os not pply to v. I (v ) =, Clm 6.4 ssrts tt G s no sprtn -cycls, so tn v loss cr t most 1 n (R0). I v s ncnt to 6-c wt ν 1 () < 0, tn t otr two cs ncnt to v 1
25 r 4-cs n ts 4-cs r c jcnt to two -cs. Ts crts cor 7-cycl, contrcton, so (R) os not pply to v n µ (v ) 0. Cs : P = K. Lt v 1, v, n v bt vrtcs n t -cycl P, so µ(v ) = (v ) or c v. By Clm 6.4, G s no sprtn -cycl, so t tr vrtcs r ncnt to common -c wt ν() = 0. Tror, c vrtx v sns cr 1 to t most (v ) 1 ncnt -cs by (R0). Rcll tt (v ) by Clm 6.6. Suppos tt (v ) =. I t (v ) > 1, t subrp o G nuc by t nboroo o v s somorpc to P or K, contrctn Clm 6.5. I (v ) 4, tn µ(v ) = (v ) 1 (v ) 1 4 (v )+ 1 4 t (v ). Tror, µ (v ) 0. Tus, n ll css prcolor vrtx v s µ (v) 0. W wll now sow tt ll objcts tt strt wt nonntv cr lso n wt nonntv cr. I s 4-c, tn (R1b) n (R1c) o not pull cr rom, snc ts woul rqur to b jcnt to 4-c tt s jcnt to -c t, but tn,, n t orm oubly-cor 7-cycl. Tus, ν () = 0 or vry 4-c. I s 5-c, tn snc G contns no cor 7-cycls, s not jcnt to two -cs n s not jcnt to 4-c. Tror, loss cr t most 8 by (R1), but loss no cr usn (R1b), so ν () > 0 or vry 5-c. I s 6-c, tn s not jcnt to -c snc G contns no cor 7-cycl. Obsrv tt by Clm 6. t bounry o s smpl 6-cycl. So sns cr trou n urn (R1), t cn sn cr 1 8 trou by (R1b), or t cn sn cr 8 trou by (R1c). T only wy tt ts wll rsult n ntv cr tr (R1) n (R) s or to sn cr 8 trou c o ts sx s by (R1c); ts wll cus ν () = 6 8 = 1 4. I s prcolor vrtx v on ts bounry, tn by Clm 6.9, v s postv cr tr (R0); by (R), rcvs cr t lst 1 4, rsultn n ν () 0. I s no ncnt prcolor vrtcs, tn snc G contns no (C), som vrtx v on t bounry o s 5 + -vrtx. By (R) v sns cr 1 4 to n nc ν () 0. Obsrv t ollown clm concrnn t structur bout vrtx tt loss cr by (R). Clm Lt v b 5 + -vrtx wt t tr ncnt cs 1,, n, n cyclc orr. I v sns cr to by (R), tn 1 n r 4-cs n s 6-c. I s 7 + -c, tn by (R1) loss cr t most 8 ν () l() 4 8 l() = 5 l() 4 > 0. 8 trou c. Tus, Tror, ν () > 0 or vry 7 + -c. Nxt, w wll consr vrtx v not n V(P). I v s 4-vrtx, tn v os not los cr by ny rul, so t rsultn cr s 0. I v s 5-vrtx, lt = mx{,t (v)} n v loss cr 1 t (v) to ncnt -cs by (R). I (R) os not pply to v, tn v sns cr t most 1 to ncnt -cs n µ (v) 0. I (R) ppls to v, tn v s ncnt to cs 1,, n wr 1 n r 4-cs n s 6-c. Snc (v) = 5 n G s no cor 7-cycl, t rul (R) ppls t most onc. I (R) ppls onc, tn t (v) n v loss cr t most by (R) n cr 1 4 by (R), so µ (v) 0. I v s 6 + -vrtx, tn lt k = t (v) n l b t numbr o tms (R) ppls to v. Notc tt k 4 5(v) snc G vos cor 7-cycls. Furtr, notc tt k +l (v), snc c
26 6-c tt ns cr rom v by (R) s prc by 4-c n t cyclc orr o cs roun v. By (Rb), v cn los cr 1 to c ncnt -c, n v cn los cr t most 1 4 to c ncnt 6-c by (R). Tn v ns wt cr µ (v) (v) 4 1 k 1 4 l. I (v) = 6, tn obsrv k +l 4 n nc µ (v) 0. I (v) = 7, tn, k, n l stsy t ollown lnr prorm wt ul on vrbls 1,, n : mn 1 k 1 4 l s.t k 0 k l 0, k, l 0 mx 7 1 s.t ,, 0 40, 1 0, 1 4 ) monstrts tt 1 k 1 4l 7 40 > 4, n T ul-sbl soluton ( 1,, ) = ( tus µ (v) > 0 or vry 7 + -vrtx. It rmns to b sown tt t clustrs rcv nou cr to bcom nonntv. Snc G contns no sprtn -cycl, G os not contn t clustr (K5c) or t clustrs (K6) (K6r). Obsrv tt tr s no prcolor vrtx v o r t most tr wr ll cs ncnt to v v lnt tr. Fnlly, t s wort notn n tt G contns rucbl conurton (C,X,x), tn tr s prcolor vrtx n t st X. I vrtx v s 5 + -vrtx or v V(P), w sy v s ull; v s 6 + -vrtx or v V(P), tn v s vy. Not tt vy vrtx v sns cr 1 to c ncnt ntvly-cr -c by (R0) or (Rb). I P = K, w cll P t prcolor c. v 1 1 (K) (K4) (K5) Fur 11: Clustrs (K), (K4), n (K5) Cs 1: (K) Lt btsolt -cn(k). I stprcolorc, tnν () = ν() = 0. Otrws, tntl cron s 1.By(R1), rcvs cr 9 8 troutsbounrys, rsultn n nonntv nl cr. Cs : (K4) Lt 1 n b -cs n mon clustr (K4). Frst, suppos wtout loss o nrlty tt 1 s t prcolor c. T ntl cr o t clustr s 1. Tn rcvs cr 1 by (R0) n cr 8 by (R1), rsultn n postv nl cr. Otrws, t ntl cr on t clustr s. By (R1), 1 n rcv cr 8 trou c o t two s on t bounry o t clustr, rsultn n cr 1. I t clustr contns prcolor vrtx u, tn t rcvs cr 1 by (R0). Otrws, snc G contns no (C), tr s 5+ -vrtx v ncnt to bot 1 n. By (R), ts vrtx sns cr t lst 1 to c o t cs, rsultn n nonntv nl cr. Cs : (K5) Lt 1,, n b -cs n -n clustr (K5), wr s jcnt to bot 1 n. Suppos tt t clustr contns prcolor c, so t ntl cr on t clustr
27 s. I s prcolor, tn t clustr rcvs cr 4 1 by (R0); 1 or s prcolor, tn t clustr rcvs cr 1 by (R0) n cr 8 by (R1). In tr cs, t nl cr s nonntv. I P = K or t clustr os not contn t prcolor c, tn t ntl cr on t clustr s. By (R1), t clustr rcvs cr 5 8, rsultn n cr 9 8. Not tt t cs 1 n orm mon n t cs n orm mon. Snc G contns no (C), tr xsts ull vrtx v ncnt to bot 1 n. Smlrly, tr xsts ull vrtx u ncnt to n. I u v, tn by (R0) or (R), v sns cr t lst 1 to c o 1 n n u sns cr t lst 1 to c o n, rsultn n nonntv cr on t clustr. I u = v n v s vy vrtx, tn v sns cr 1 to c c 1,, n, rsultn n nonntv cr on t clustr. Otrws, suppos tt u = v / V(P) n v s 5-vrtx. Snc G contns no (C4), tr xsts notr ull vrtx w tt s ncnt to t lst on o 1 n. By (R), v sns cr 1 to 1,, n, n by (R0) or (R), w sns cr t lst 1 to on o 1 n, rsultn n nonntv cr on t clustr. u 1 u 1 v u 4 v u 5 u 4 u u 1 u 1 (K5b) (K6) (K6b) Fur 1: Clustrs (K5b), (K6), n (K6b) Cs 4: (K5b) Lt 1,,, n 4 b -cs n 4-wl (K5b). I t clustr contns prcolor c, tn t ntl cr on t clustr s ; t clustr rcvs cr 5 1 by (R0) n cr 8 by (R1), rsultn n postv nl cr. Otrws, t ntl cr on ts clustr s 4. By (R1), t clustr rcvs cr 4 8, rsultn n cr 5. Lt v b t 4-vrtx ncnt to ll our -cs. Lt u 1, u, u, n u 4 b t vrtcs jcnt to v, orr cyclclly suc tt vu u +1 s t bounry o t -c or {1,,} n vu 4 u 1 s t bounry o 4. Snc t clustr os not contn t prcolor c, v s not prcolor vrtx. Snc G contns no (C), c u s ull vrtx. Wn u s 5-vrtx, t s ncnt to two 7 + -cs, so u sns cr 1 to c ncnt -c by (R). Tus, c u sns cr t lst 1 to t clustr by (R0) or (R), rsultn n nonntv nl cr. Cs 5: (K6) Lt 1,,, n 4 b -cs n 4-strp clustr (K6). I t clustr contns t prcolor c, tn t ntl cr on t clustr s. I 1 or 4 s prcolor, tn t clustr rcvs cr 1 by (R0) n cr 4 8 by (R1); or s prcolor, tn t clustr rcvs cr 5 1 by (R0) n cr 5 8 by (R1). In tr cs, t rsultn nl cr s nonntv. I t clustr os not contn t prcolor c, tn t ntl cr on ts clustr s 4. By (R1), t clustr rcvs cr 6 8, rsultn n cr 7 4. Not tt or {1,,}, t cs n +1 orm mon. Snc G contns no (C), tr xsts ull vrtx v ncnt to bot n +1. Lt u 1 b ull vrtx ncnt to n. Wtout loss o nrlty, u 1 s not ncnt to 4, so tr s ull vrtx u ncnt to 1 n. I u 1 s vy vrtx, t clustr rcvs cr 1 rom u 1 by (R0) or (Rb), n cr t lst 1 rom u by (R0) or (R), rsultn n postv nl cr. Otrws, 4 u 4
28 u 1 s 5-vrtx, so u 1 sns cr 1 by (R), rsultn n cr 4. I u s ncnt to, tn u sns cr t lst 1 by (R0) or (R), rsultn n postv nl cr. Otrws, u s ncnt wt 1 n but not. I u s lr vrtx, t sns cr 1 by (R0) or (Rb). Otrws, snc G contns ntr (C) or (C4), tr s tr ull vrtx u. T clustr rcvs cr 1 rom u by (R) n cr t lst 1 rom u by (R0) or (R). In c cs, t rsultn nl cr s nonntv. Cs 6: (K6b) Lt 1,,, n 4 b -cs n 4-n clustr (K6b). Lt v b t cntr o t n, wt nbors u 1, u, u, u 4, n u 5 wr or {1,,}, n +1 r jcnt on t vu +1. I t clustr contns t prcolor c, tn t ntl cr on t clustr s. I 1 or 4 s prcolor, tn t clustr rcvs cr 4 1 by (R0) n cr 4 8 by (R1); or s prcolor, tn t clustr rcvs cr 5 1 by (R0) n cr 5 8 by (R1). In tr cs, t rsultn nl cr s postv. I t clustr os not contn t prcolor c, tn t ntl cr on ts clustr s 4. By (R1), t clustr rcvs cr 6 8, rsultn n cr 7 4. I v s vy vrtx, tn by (R0) or (Rb) v sns cr 4 1 to t clustr, rsultn n postv cr. Otrws, v / V(P) n v s 5-vrtx, so v sns cr 1 to t clustr by (R), rsultn n cr 4. I tr s vy vrtx n {u,u,u 4 }, tn tt vrtx contrbuts cr 1 to t clustr, rsultn n postv cr. I tr s no vy vrtx n {u,u,u 4 }, tn tr s t lst on 5-vrtx n {u,u,u 4 } snc G contns no (C4). I tr r multpl 5-vrtcs n {u,u,u 4 }, tn c sns cr 1 to t clustr by (R), rsultn n postv cr. I tr s only 5-vrtx w mon u,u, n u 4, tn tr s ull vrtx z {u 1,u 5 } snc G os not contn (C4) or (C5); t clustr rcvs cr 1 rom w by (R) n t lst 1 rom z by (R0) or (R), rsultn n postv nl cr. u 1 u u 1 u 6 u 4 u 5 u 4 u (K6c) v 4 1 u 1 u 4 (K6) w Fur 1: Clustrs (K6c) n (K6). Cs 7: (K6c) Lt 1,,, n 4 b t -cs o ts clustr (K6c) wr 4 s jcnt to c or {1,,}. I t clustr contns t prcolor c, tn t ntl cr on t clustr s. I on o 1, or s prcolor, t clustr rcvs cr 4 1 by (R0) n cr 4 8 by (R1). I 4 s prcolor, tn t clustr rcvs cr 6 1 by (R0). In tr cs, t rsultn nl cr s nonntv. I t clustr os not contn t prcolor c, tn t ntl cr on t clustr s 4. By (R1), t clustr rcvs cr 6 8, rsultn n cr 7 4. Lt u 1, u, u, u 4, u 5, n u 6 b t vrtcs on t bounry o t clustr orr suc tt u,u 4,u 6 r t vrtcs ncnt to 1 n, n, n n 1, rspctvly. Snc G contns no (C), tr r t lst two ull vrtcs n {u,u 4,u 6 }. By (R0) or (R), ts vrtcs c sn cr t lst 1 to t clustr, rsultn n postv totl cr. 5
29 Cs 8: (K6) Lt 1,,, n 4 b cyclclly-orr -cs n 4-wl wt cntr vrtx v wr n +1 sr common or {1,,,4}, wr ncs r tkn moulo 4; lt b -c jcnt to 4 but not ncnt to v, compltn our clustr (K6). I t clustr contns t prcolor c, tn t ntl cr on t clustr s 4. I 1 or s prcolor, tn t clustr rcvs cr 6 1 by (R0) n cr 4 8 by (R1). I s prcolor, tn t clustr rcvs cr 5 1 by (R0) n cr 4 8 by (R1). I 4 s prcolor, tn t clustr rcvs cr 7 1 by (R0) n cr 5 8 by (R1). In c o t bov css, t nl cr s nonntv. I s prcolor, tn t clustr rcvs cr 4 1 by (R0) n cr 8 by (R1), rsultn n cr 7 8. Lt N(v) = {u 1,u,u,u 4 } wr u s ncnt to n +1 or ll {1,,,4}. Snc G os not contn (C), u 1 n u r ull vrtcs. Ec o u 1 n u sns cr t lst 1 to t clustr by (R), rsultn n nonntv cr. I t clustr os not contn t prcolor c, tn t ntl cr on ts clustr s 5 n v / V(P). By (R1), t clustr rcvs cr 5 8, rsultn n cr 5 8. Snc G os not contn (C), u 1, u, u, n u 4 r ull vrtcs. By (R0) or (R), t clustr rcvs cr t lst 1 rom c o u 1 n u n cr t lst 1 rom c o u n u 4, rsultn n postv nl cr. u 4 u 5 1 u 1 5 v u 1 4 u u (K6) z 1 w (K6) u Fur 14: Clustrs (K6) n (K6). Cs 9: (K6) Lt 1,,, 4, n 5 b t cyclclly-orr -cs n 5-wl wt cntr vrtx v wr n +1 sr common or {1,,,4,5}, wr ncs r tkn moulo 5. Lt N(v) = {u 1,u,u,u 4,u 5 } wr u s ncnt to n +1 or {1,,,4,5}. I t clustr contns t prcolor c, tn t ntl cr on t clustr s 4. T clustr rcvs cr 6 1 by (R1), rsultn n postv nl cr. I t clustr os not contn t prcolor c, tn t ntl cr s 5 n v / V(P). by (R0) n cr 4 8 By (R1), t clustr rcvs cr 5 8, n by (R), t clustr rcvs cr 1 rom v, rsultn n cr Snc G os not contn (C4) or (C6), tr r t lst tr ull vrtcs n N(v). I N(v) contns t lst tr vy vrtcs, tn t clustr rcvs cr t lst 6 1 by (R0) or (Rb), rsultn n postv nl cr. I N(v) contns xctly two vy vrtcs, tn t clustr rcvs cr by (R0) or (Rb) n cr rom ull vrtx by (R), rsultn n postv cr. I N(v) contns xctly on vy vrtx, tn t clustr rcvs cr 1 1 by (R0) or (Rb) n cr rom c o two ull vrtcs by (R), rsultn n postv nl cr. I N(v) contns no vy vrtcs, tn tr r t lst tr ull vrtcs n N(v). Snc G os not contn (C4), tr r t lst two nonjcnt 5-vrtcs n N(v). Furtr, snc G os not contn (C6), (C7), or (C8), tr r t lst our 5-vrtcs n N(v). T clustr 6
(4, 2)-choosability of planar graphs with forbidden structures
(4, )-ooslty o plnr rps wt orn struturs Znr Brkkyzy 1 Crstopr Cox Ml Dryko 1 Krstn Honson 1 Mot Kumt 1 Brnr Lký 1, Ky Mssrsmt 1 Kvn Moss 1 Ktln Nowk 1 Kvn F. Plmowsk 1 Drrk Stol 1,4 Dmr 11, 015 Astrt All
More informationThe University of Sydney MATH 2009
T Unvrsty o Syny MATH 2009 APH THEOY Tutorl 7 Solutons 2004 1. Lt t sonnt plnr rp sown. Drw ts ul, n t ul o t ul ( ). Sow tt s sonnt plnr rp, tn s onnt. Du tt ( ) s not somorp to. ( ) A onnt rp s on n
More informationWeighted Graphs. Weighted graphs may be either directed or undirected.
1 In mny ppltons, o rp s n ssot numrl vlu, ll wt. Usully, t wts r nonntv ntrs. Wt rps my tr rt or unrt. T wt o n s otn rrr to s t "ost" o t. In ppltons, t wt my msur o t lnt o rout, t pty o ln, t nry rqur
More informationDepth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong
Dprtmnt o Computr Sn n Ennrn Cns Unvrsty o Hon Kon W v lry lrn rt rst sr (BFS). Toy, w wll suss ts sstr vrson : t pt rst sr (DFS) lortm. Our susson wll on n ous on rt rps, us t xtnson to unrt rps s strtorwr.
More information5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees
/1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our
More information4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.
Cptr 4 4 Intrvl Suln Gry Alortms Sls y Kvn Wyn Copyrt 005 Prson-Ason Wsly All rts rsrv Intrvl Suln Intrvl Suln: Gry Alortms Intrvl suln! Jo strts t s n nss t! Two os omptl ty on't ovrlp! Gol: n mxmum sust
More informationIn which direction do compass needles always align? Why?
AQA Trloy Unt 6.7 Mntsm n Eltromntsm - Hr 1 Complt t p ll: Mnt or s typ o or n t s stronst t t o t mnt. Tr r two typs o mnt pol: n. Wrt wt woul ppn twn t pols n o t mnt ntrtons low: Drw t mnt l lns on
More informationLecture 20: Minimum Spanning Trees (CLRS 23)
Ltur 0: Mnmum Spnnn Trs (CLRS 3) Jun, 00 Grps Lst tm w n (wt) rps (unrt/rt) n ntrou s rp voulry (vrtx,, r, pt, onnt omponnts,... ) W lso suss jny lst n jny mtrx rprsntton W wll us jny lst rprsntton unlss
More informationDivided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano
RIGHT-ANGLE WEAVE Dv mons Mm t look o ts n rlt tt s ptvly p sn y Py Brnkmn Mttlno Dv your mons nto trnls o two or our olors. FCT-SCON0216_BNB66 2012 Klm Pulsn Co. Ts mtrl my not rprou n ny orm wtout prmsson
More informationClosed Monochromatic Bishops Tours
Cos Monoromt Bsops Tours Jo DMo Dprtmnt o Mtmts n Sttsts Knnsw Stt Unvrsty, Knnsw, Gor, 0, USA mo@nnsw.u My, 00 Astrt In ss, t sop s unqu s t s o to sn oor on t n wt or. Ts ms os tour n w t sop vsts vry
More informationHaving a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall
Hvn lps o so o t posslts or solutons o lnr systs, w ov to tos o nn ts solutons. T s w sll us s to try to sply t syst y lntn so o t vrls n so ts qutons. Tus, w rr to t to s lnton. T prry oprton nvolv s
More informationCMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017
Rn: Not ovr n or rns. CMSC 451: Ltr 4 Brs n 2-E Conntvty Trsy, Sp 7, 2017 Hr-Orr Grp Conntvty: (T ollown mtrl ppls only to nrt rps!) Lt G = (V, E) n onnt nrt rp. W otn ssm tt or rps r onnt, t somtms t
More informationSpanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1
Spnnn Trs BFS, DFS spnnn tr Mnmum spnnn tr Mr 28, 2018 Cn Hrn / Gory Tn 1 Dpt-rst sr Vsts vrts lon snl pt s r s t n o, n tn ktrks to t rst junton n rsums own notr pt Mr 28, 2018 Cn Hrn / Gory Tn 2 Dpt-rst
More informationCMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk
CMPS 2200 Fll 2017 Grps Crol Wnk Sls ourtsy o Crls Lsrson wt ns n tons y Crol Wnk 10/23/17 CMPS 2200 Intro. to Alortms 1 Grps Dnton. A rt rp (rp) G = (V, E) s n orr pr onsstn o st V o vrts (snulr: vrtx),
More information(Minimum) Spanning Trees
(Mnmum) Spnnn Trs Spnnn trs Kruskl's lortm Novmr 23, 2017 Cn Hrn / Gory Tn 1 Spnnn trs Gvn G = V, E, spnnn tr o G s onnt surp o G wt xtly V 1 s mnml sust o s tt onnts ll t vrts o G G = Spnnn trs Novmr
More informationLecture II: Minimium Spanning Tree Algorithms
Ltur II: Mnmum Spnnn Tr Alortms Dr Krn T. Hrly Dprtmnt o Computr Sn Unvrsty Coll Cork Aprl 0 KH (/0/) Ltur II: Mnmum Spnnn Tr Alortms Aprl 0 / 5 Mnmum Spnnn Trs Mnmum Spnnn Trs Spnnn Tr tr orm rom rp s
More informationMAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017
MAT3707/201/1/2017 Tutoril lttr 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Smstr 1 Dprtmnt o Mtmtil Sins SOLUTIONS TO ASSIGNMENT 01 BARCODE Din tomorrow. univrsity o sout ri SOLUTIONS TO ASSIGNMENT
More informationStrongly connected components. Finding strongly-connected components
Stronly onnt omponnts Fnn stronly-onnt omponnts Tylr Moor stronly onnt omponnt s t mxml sust o rp wt rt pt twn ny two vrts SE 3353, SMU, Dlls, TX Ltur 9 Som sls rt y or pt rom Dr. Kvn Wyn. For mor normton
More information(4, 2)-choosability of planar graphs with forbidden structures
1 (4, )-oosility o plnr rps wit orin struturs 4 5 Znr Brikkyzy 1 Cristopr Cox Mil Diryko 1 Kirstn Honson 1 Moit Kumt 1 Brnr Liiký 1, Ky Mssrsmit 1 Kvin Moss 1 Ktln Nowk 1 Kvin F. Plmowski 1 Drrik Stol
More informationImproving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)
POW CSE 36: Dt Struturs Top #10 T Dynm (Equvln) Duo: Unon-y-Sz & Pt Comprsson Wk!! Luk MDowll Summr Qurtr 003 M! ZING Wt s Goo Mz? Mz Construton lortm Gvn: ollton o rooms V Conntons twn t rooms (ntlly
More informationSingle Source Shortest Paths (with Positive Weights)
Snl Sour Sortst Pts (wt Postv Wts) Yuf To ITEE Unvrsty of Qunslnd In ts ltur, w wll rvst t snl sour sortst pt (SSSP) problm. Rll tt w v lrdy lrnd tt t BFS lortm solvs t problm ffntly wn ll t ds v t sm
More informationELECTRONIC SUPPLEMENTARY INFORMATION
Elctronc Supplmntry Mtrl (ESI) or Polymr Cmstry. Ts ournl s T Royl Socty o Cmstry 2015 ELECTRONIC SUPPLEMENTARY INFORMATION Poly(lyln tcont)s An ntrstn clss o polystrs wt proclly loct xo-cn oul ons suscptl
More informationMaximum Matching Width: new characterizations and a fast algorithm for dominating set
Maxmum Matcn Wdt: nw caractrzatons and a ast alortm or domnatn st 정지수 (KAIST) jont work wt Sv Hortmo Sætr and Jan Arn Tll (Unvrsty o Brn) 1st Koran Worksop on Grap Tory 2015.8.27. KAIST Grap wdt paramtrs
More informationExam 2 Solutions. Jonathan Turner 4/2/2012. CS 542 Advanced Data Structures and Algorithms
CS 542 Avn Dt Stutu n Alotm Exm 2 Soluton Jontn Tun 4/2/202. (5 ont) Con n oton on t tton t tutu n w t n t 2 no. Wt t mllt num o no tt t tton t tutu oul ontn. Exln you nw. Sn n mut n you o u t n t, t n
More informationd e c b a d c b a d e c b a a c a d c c e b
FLAT PEYOTE STITCH Bin y mkin stoppr -- sw trou n pull it lon t tr until it is out 6 rom t n. Sw trou t in witout splittin t tr. You soul l to sli it up n own t tr ut it will sty in pl wn lt lon. Evn-Count
More informationPlanar convex hulls (I)
Covx Hu Covxty Gv st P o ots 2D, tr ovx u s t sst ovx oyo tt ots ots o P A oyo P s ovx or y, P, t st s try P. Pr ovx us (I) Coutto Gotry [s 3250] Lur To Bowo Co ovx o-ovx 1 2 3 Covx Hu Covx Hu Covx Hu
More informationTheorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.
Cptr 11: Trs 11.1 - Introuton to Trs Dnton 1 (Tr). A tr s onnt unrt rp wt no sp ruts. Tor 1. An unrt rp s tr n ony tr s unqu sp pt twn ny two o ts vrts. Dnton 2. A root tr s tr n w on vrtx s n snt s t
More informationMATERIAL SEE BOM ANGLES = 2 FINISH N/A
9 NOTS:. SSML N NSPT PR SOP 0-9... NSTLL K STKR N X L STKR TO NS O SROU WT TP. 3. PR-PK LNR RNS WT P (XTRM PRSSUR NL R ) RS OR NNRN PPROV QUVLNT. 4. OLOR TT Y T SLS ORR. RRN T MNS OM OR OMPONNTS ONTNN
More information2 Trees and Their Applications
Trs n Tr Appltons. Proprts o trs.. Crtrzton o trs Dnton. A rp s ll yl (or orst) t ontns no yls. A onnt yl rp s ll tr. Quston. Cn n yl rp v loops or prlll s? Notton. I G = (V, E) s rp n E, tn G wll not
More informationGraph Search Algorithms CSE
Grp Src Aortms 1 Grp b No ~ cty or computr E ~ ro or t cb c Unrct or Drct A surprsny r numbr o computton probms cn b xprss s rp probms. 2 Drct n Unrct Grps () A rct rp G = (V, E), wr V = {1,2,3,4,5,6}
More informationCOMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017
COMP 250 Ltur 29 rp trvrsl Nov. 15/16, 2017 1 Toy Rursv rp trvrsl pt rst Non-rursv rp trvrsl pt rst rt rst 2 Hs up! Tr wr w mstks n t sls or S. 001 or toy s ltur. So you r ollown t ltur rorns n usn ts
More informationPlatform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments
Ston 7 - Rpr Prours Srv Mnul - Son Eton Pltorm Controls 1-1 Joystk Controllrs Mntnn oystk ontrollrs t t propr sttns s ssntl to s mn oprton. Evry oystk ontrollr soul oprt smootly n prov proportonl sp ontrol
More informationMinimum Spanning Trees (CLRS 23)
Mnmum Spnnn Trs (CLRS 3) T prolm Rll t nton o spnnn tr: Gvn onnt, unrt rp G = (V, E), sust o s o G su tt ty onnt ll vrts n G n orm no yls s ll spnnn tr (ST) o G. Any unrt, onnt rp s spnnn tr. Atully, rp
More informationCSE 332. Data Structures and Parallelism
Am Blnk Ltur 20 Wntr 2017 CSE 332 Dt Struturs n Prlllsm CSE 332: Dt Struturs n Prlllsm Grps 1: Wt s Grp? DFS n BFS LnkLsts r to Trs s Trs r to... 1 Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus,
More informationCSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2
Am Blnk Ltur 19 Summr 2015 CSE 332: Dt Astrtons CSE 332 Grps 1: Wt s Grp? DFS n BFS Dt Astrtons LnkLsts r to Trs s Trs r to... 1 A Grp s Tny... 2 Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus, Hps,
More informationFractions. Mathletics Instant Workbooks. Simplify. Copyright
Frctons Stunt Book - Srs H- Smplfy + Mthltcs Instnt Workbooks Copyrht Frctons Stunt Book - Srs H Contnts Topcs Topc - Equvlnt frctons Topc - Smplfyn frctons Topc - Propr frctons, mpropr frctons n mx numbrs
More informationPreview. Graph. Graph. Graph. Graph Representation. Graph Representation 12/3/2018. Graph Graph Representation Graph Search Algorithms
/3/0 Prvw Grph Grph Rprsntton Grph Srch Algorthms Brdth Frst Srch Corrctnss of BFS Dpth Frst Srch Mnmum Spnnng Tr Kruskl s lgorthm Grph Drctd grph (or dgrph) G = (V, E) V: St of vrt (nod) E: St of dgs
More informationVLSI Testing Assignment 2
1. 5-vlu D-clculus trut tbl or t XOR unction: XOR 0 1 X D ~D 0 0 1 X D ~D 1 1 0 X ~D D X X X X X X D D ~D X 0 1 ~D ~D D X 1 0 Tbl 1: 5-vlu D-clculus Trut Tbl or t XOR Function Sinc 2-input XOR t wors s
More informationa b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...
Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th
More informationCS 103 BFS Alorithm. Mark Redekopp
CS 3 BFS Aloritm Mrk Rkopp Brt-First Sr (BFS) HIGHLIGHTED ALGORITHM 3 Pt Plnnin W'v sn BFS in t ontxt o inin t sortst pt trou mz? S?? 4 Pt Plnnin W xplor t 4 niors s on irtion 3 3 3 S 3 3 3 3 3 F I you
More informationMinimum Spanning Trees
Mnmum Spnnng Trs Spnnng Tr A tr (.., connctd, cyclc grph) whch contns ll th vrtcs of th grph Mnmum Spnnng Tr Spnnng tr wth th mnmum sum of wghts 1 1 Spnnng forst If grph s not connctd, thn thr s spnnng
More informationD t r l f r th n t d t t pr p r d b th t ff f th l t tt n N tr t n nd H n N d, n t d t t n t. n t d t t. h n t n :.. vt. Pr nt. ff.,. http://hdl.handle.net/2027/uiug.30112023368936 P bl D n, l d t z d
More informationSAMPLE LITANY OF THE SAINTS E/G. Dadd9/F. Aadd9. cy. Christ, have. Lord, have mer cy. Christ, have A/E. Dadd9. Aadd9/C Bm E. 1. Ma ry and. mer cy.
LTNY OF TH SNTS Cntrs Gnt flwng ( = c. 100) /G Ddd9/F ll Kybrd / hv Ddd9 hv hv Txt 1973, CL. ll rghts rsrvd. Usd wth prmssn. Musc: D. Bckr, b. 1953, 1987, D. Bckr. Publshd by OCP. ll rghts rsrvd. SMPL
More information46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l pp n nt n th
n r t d n 20 0 : T P bl D n, l d t z d http:.h th tr t. r pd l 46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l
More informationThe Constrained Longest Common Subsequence Problem. Rotem.R and Rotem.H
T Constrn Lonst Common Susqun Prolm Rotm.R n Rotm.H Prsntton Outln. LCS Alortm Rmnr Uss o LCS Alortm T CLCS Prolm Introuton Motvton For CLCS Alortm T CLCS Prolm Nïv Alortm T CLCS Alortm A Dynm Prormmn
More informationComputer Graphics. Viewing & Projections
Vw & Ovrvw rr : rss r t -vw trsrt: st st, rr w.r.t. r rqurs r rr (rt syst) rt: 2 trsrt st, rt trsrt t 2D rqurs t r y rt rts ss Rr P usuy st try trsrt t wr rts t rs t surs trsrt t r rts u rt w.r.t. vw vu
More informationERDOS-SMARANDACHE NUMBERS. Sabin Tabirca* Tatiana Tabirca**
ERDO-MARANDACHE NUMBER b Tbrc* Tt Tbrc** *Trslv Uvrsty of Brsov, Computr cc Dprtmt **Uvrsty of Mchstr, Computr cc Dprtmt Th strtg pot of ths rtcl s rprstd by rct work of Fch []. Bsd o two symptotc rsults
More informationDOCUMENT STATUS: RELEASE
RVSON STORY RV T SRPTON O Y 0-4-0 RLS OR PROUTON 5 MM -04-0 NS TRU PLOT PROUTON -- S O O OR TLS 30 MM 03-3-0 3-044 N 3-45, TS S T TON O PROTTV RM OVR. 3 05--0 LT 3-004, NOT, 3-050 3 0//00 UPT ST ROM SN,
More informationSAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2
AMPLE C EXAM UETION WITH OLUTION: prt. It n sown tt l / wr.7888l. I Φ nots orul or pprotng t vlu o tn t n sown tt t trunton rror o ts pproton s o t or or so onstnts ; tt s Not tt / L Φ L.. Φ.. /. /.. Φ..787.
More informationDOCUMENT STATUS: LA-S5302-XXXXS LA, SSS, TRICEPS EXTENSION VERY
RVSON STORY RV T SRPTON O Y //0 RLS OR PROUTON T LN MR ----- L /0/0 UPT SN N OMPONNTS US: S 3-03 (*N TWO PLS ONLY) WS 3-5, PRT 3-00 TO SSMLY. T OLLOWN UPT: 3-30, 3-403, 3-403, 3-40, 3-45, 3-4, 3-5. 30
More informationMinimum Spanning Trees (CLRS 23)
Mnmum Spnnn Trs (CLRS 3) T prolm Gvn onnt, unrt rp G = (V, E), sust o s o G su tt ty onnt ll vrts n G n orm no yls s ll spnnn tr (ST) o G. Clm: Any unrt, onnt rp s spnnn tr (n nrl rp my v mny spnnn trs).
More information4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n, h r th ff r d nd
n r t d n 20 20 0 : 0 T P bl D n, l d t z d http:.h th tr t. r pd l 4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n,
More informationCycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!
Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik
More informationGrade 7/8 Math Circles March 4/5, Graph Theory I- Solutions
ulty o Mtmtis Wtrloo, Ontrio N ntr or ution in Mtmtis n omputin r / Mt irls Mr /, 0 rp Tory - Solutions * inits lln qustion. Tr t ollowin wlks on t rp low. or on, stt wtr it is pt? ow o you know? () n
More informationTangram Fractions Overview: Students will analyze standard and nonstandard
ACTIVITY 1 Mtrils: Stunt opis o tnrm mstrs trnsprnis o tnrm mstrs sissors PROCEDURE Skills: Dsriin n nmin polyons Stuyin onrun Comprin rtions Tnrm Frtions Ovrviw: Stunts will nlyz stnr n nonstnr tnrms
More informationPR D NT N n TR T F R 6 pr l 8 Th Pr d nt Th h t H h n t n, D D r r. Pr d nt: n J n r f th r d t r v th tr t d rn z t n pr r f th n t d t t. n
R P RT F TH PR D NT N N TR T F R N V R T F NN T V D 0 0 : R PR P R JT..P.. D 2 PR L 8 8 J PR D NT N n TR T F R 6 pr l 8 Th Pr d nt Th h t H h n t n, D.. 20 00 D r r. Pr d nt: n J n r f th r d t r v th
More informationGraph Search (6A) Young Won Lim 5/18/18
Grp Sr (6A) Youn Won Lm Copyrt () 2015 2018 Youn W. Lm. Prmon rnt to opy, trut n/or moy t oumnt unr t trm o t GNU Fr Doumntton Ln, Vron 1.2 or ny ltr vron pul y t Fr Sotwr Founton; wt no Invrnt Ston, no
More informationOpenMx Matrices and Operators
OpnMx Mtris n Oprtors Sr Mln Mtris: t uilin loks Mny typs? Dnots r lmnt mxmtrix( typ= Zro", nrow=, nol=, nm="" ) mxmtrix( typ= Unit", nrow=, nol=, nm="" ) mxmtrix( typ= Int", nrow=, nol=, nm="" ) mxmtrix(
More informationl f t n nd bj t nd x f r t l n nd rr n n th b nd p phl t f l br r. D, lv l, 8. h r t,., 8 6. http://hdl.handle.net/2027/miun.aey7382.0001.001 P bl D n http://www.hathitrust.org/access_use#pd Th r n th
More informationTh n nt T p n n th V ll f x Th r h l l r r h nd xpl r t n rr d nt ff t b Pr f r ll N v n d r n th r 8 l t p t, n z n l n n th n rth t rn p rt n f th v
Th n nt T p n n th V ll f x Th r h l l r r h nd xpl r t n rr d nt ff t b Pr f r ll N v n d r n th r 8 l t p t, n z n l n n th n rth t rn p rt n f th v ll f x, h v nd d pr v n t fr tf l t th f nt r n r
More informationTOPIC 5: INTEGRATION
TOPIC 5: INTEGRATION. Th indfinit intgrl In mny rspcts, th oprtion of intgrtion tht w r studying hr is th invrs oprtion of drivtion. Dfinition.. Th function F is n ntidrivtiv (or primitiv) of th function
More informationPhylogenetic Tree Inferences Using Quartet Splits. Kevin Michael Hathcock. Bachelor of Science Lenoir-Rhyne University 2010
Pylont Tr Inrns Usn Qurtt Splts By Kvn Ml Htok Blor o Sn Lnor-Ryn Unvrsty 2010 Sumtt n Prtl Fulllmnt o t Rqurmnts or t Dr o Mstr o Sn n Mtmts Coll o Arts n Sns Unvrsty o Sout Croln 2012 Apt y: Év Czrk,
More information1- I. M. ALGHROUZ: A New Approach To Fractional Derivatives, J. AOU, V. 10, (2007), pp
Jourl o Al-Qus Op Uvrsy or Rsrch Sus - No.4 - Ocobr 8 Rrcs: - I. M. ALGHROUZ: A Nw Approch To Frcol Drvvs, J. AOU, V., 7, pp. 4-47 - K.S. Mllr: Drvvs o or orr: Mh M., V 68, 995 pp. 83-9. 3- I. PODLUBNY:
More informationComplete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT
Complt Solutions or MATH 012 Quiz 2, Otor 25, 2011, WTT Not. T nswrs ivn r r mor omplt tn is xpt on n tul xm. It is intn tt t mor omprnsiv solutions prsnt r will vlul to stunts in stuyin or t inl xm. In
More informationH NT Z N RT L 0 4 n f lt r h v d lt n r n, h p l," "Fl d nd fl d " ( n l d n l tr l t nt r t t n t nt t nt n fr n nl, th t l n r tr t nt. r d n f d rd n t th nd r nt r d t n th t th n r lth h v b n f
More informationDOCUMENT STATUS: MINTP0 E-ST5080, BASE, NO DISPLAY VENDOR: 15.5 INCH MATERIAL SEE BOM FINISH REVISION HISTORY ITEM NO. PART NUMBER DESCRIPTION
RV T RVSON STORY SRPTON O Y 0-0-0 PROUTON RLS K. N NOTS:. SRL LL NORMTON: a) VOLTS: V b) MPS:.0 c) YLS: N/ d) WTTS: W e) PS: N/ f) PX #: PX. RTTON LOOS: S / / LN R WT SOPROPYL LOLOL PROR TO PLN.. PK M:
More informationMINI POST SERIES BALUSTRADE SYSTEM INSTALLATION GUIDE PRODUCT CODE: MPS-RP
MN POST SRS LUSTR SYSTM NSTLLTON U PROUT O: MPS-RP 0 R0 WLL LN 0 RONT LVTON VW R0 N P 0 T RUR LOK LOT ON LSS. SLON SL TYP. OT SS 000 LSS T 0 00 SRS LSS WT 00/00 (0mm NRMNTS VLL) MX. 000 00-0 (ROMMN) 00
More informationMath 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4
Mt 166 WIR, Sprin 2012, Bnjmin urisp Mt 166 Wk in Rviw 2 Stions 1.1, 1.2, 1.3, & 1.4 1. S t pproprit rions in Vnn irm tt orrspon to o t ollowin sts. () (B ) B () ( ) B B () (B ) B 1 Mt 166 WIR, Sprin 2012,
More informationApplications of trees
Trs Apptons o trs Orgnzton rts Attk trs to syst Anyss o tr ntworks Prsng xprssons Trs (rtrv o norton) Don-n strutur Mutstng Dstnton-s orwrng Trnsprnt swts Forwrng ts o prxs t routrs Struturs or nt pntton
More information,. *â â > V>V. â ND * 828.
BL D,. *â â > V>V Z V L. XX. J N R â J N, 828. LL BL D, D NB R H â ND T. D LL, TR ND, L ND N. * 828. n r t d n 20 2 2 0 : 0 T http: hdl.h ndl.n t 202 dp. 0 02802 68 Th N : l nd r.. N > R, L X. Fn r f,
More information4 8 N v btr 20, 20 th r l f ff nt f l t. r t pl n f r th n tr t n f h h v lr d b n r d t, rd n t h h th t b t f l rd n t f th rld ll b n tr t d n R th
n r t d n 20 2 :24 T P bl D n, l d t z d http:.h th tr t. r pd l 4 8 N v btr 20, 20 th r l f ff nt f l t. r t pl n f r th n tr t n f h h v lr d b n r d t, rd n t h h th t b t f l rd n t f th rld ll b n
More informationDental PBRN Study: Reasons for replacement or repair of dental restorations
Dntl PBRN Stuy: Rsons or rplmnt or rpr o ntl rstortons Us ts Dt Collton Form wnvr stuy rstorton s rpl or rpr. For nrollmnt n t ollton you my rpl or rpr up to 4 rstortons, on t sm ptnt, urn snl vst. You
More information, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management
nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o
More informationWalk Like a Mathematician Learning Task:
Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics
More informationFace Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction
F Dtto Roto Lr Alr F Roto C Y I Ursty O solto: tto o l trs s s ys os ot. Dlt to t to ltpl ws. F Roto Aotr ppro: ort y rry s tor o so E.. 56 56 > pot 6556- stol sp A st o s t ps to ollto o pots ts sp. F
More informationTh pr nt n f r n th f ft nth nt r b R b rt Pr t r. Pr t r, R b rt, b. 868. xf rd : Pr nt d f r th B bl r ph l t t th xf rd n v r t Pr, 00. http://hdl.handle.net/2027/nyp.33433006349173 P bl D n n th n
More informationn r t d n :4 T P bl D n, l d t z d th tr t. r pd l
n r t d n 20 20 :4 T P bl D n, l d t z d http:.h th tr t. r pd l 2 0 x pt n f t v t, f f d, b th n nd th P r n h h, th r h v n t b n p d f r nt r. Th t v v d pr n, h v r, p n th pl v t r, d b p t r b R
More information0 t b r 6, 20 t l nf r nt f th l t th t v t f th th lv, ntr t n t th l l l nd d p rt nt th t f ttr t n th p nt t th r f l nd d tr b t n. R v n n th r
n r t d n 20 22 0: T P bl D n, l d t z d http:.h th tr t. r pd l 0 t b r 6, 20 t l nf r nt f th l t th t v t f th th lv, ntr t n t th l l l nd d p rt nt th t f ttr t n th p nt t th r f l nd d tr b t n.
More informationOn Hamiltonian Tetrahedralizations Of Convex Polyhedra
O Ht Ttrrzts O Cvx Pyr Frs C 1 Q-Hu D 2 C A W 3 1 Dprtt Cputr S T Uvrsty H K, H K, C. E: @s.u. 2 R & TV Trsss Ctr, Hu, C. E: q@163.t 3 Dprtt Cputr S, Mr Uvrsty Nwu St. J s, Nwu, C A1B 35. E: w@r.s.u. Astrt
More informationGraphs Depth First Search
Grp Dpt Frt Sr SFO 337 LAX 1843 1743 1233 802 DFW ORD - 1 - Grp Sr Aort - 2 - Outo Ø By unrtnn t tur, you ou to: q L rp orn to t orr n w vrt r ovr, xpor ro n n n pt-rt r. q Cy o t pt-rt r tr,, orwr n ro
More information23 Minimum Spanning Trees
3 Mnmum Spnnn Trs Eltron rut sns otn n to mk t pns o svrl omponnts ltrlly quvlnt y wrn tm totr. To ntronnt st o n pns, w n us n rrnmnt o n wrs, onntn two pns. O ll su rrnmnts, t on tt uss t lst mount o
More informationlearning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms
rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r
More informationa g f 8 e 11 Also: Minimum degree, maximum degree, vertex of degree d 1 adjacent to vertex of degree d 2,...
Warmup: Lt b 2 c 3 d 1 12 6 4 5 10 9 7 a 8 11 (i) Vriy tat G is connctd by ivin an xampl o a walk rom vrtx a to ac o t vrtics b. (ii) Wat is t sortst pat rom a to c? to? (iii) Wat is t lonst pat rom a
More informationL.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE
N URY T NORTON PROV N RRONOUS NORTON NVRTNTY PROV. SPY S NY TY OR UT T TY RY OS NOT URNT T S TT T NORTON PROV S ORRT, NSR S POSS, VRY ORT S N ON N T S T TY RY. TS NORTON S N OP RO RORS RT SU "" YW No.
More information1 Introduction to Modulo 7 Arithmetic
1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w
More informationDOCUMENT STATUS: CORE HEALTH & FITNESS, LLC IL-D2002-XXAAX IP,DUAL ADJUSTIBLE PULLEY MATERIAL SEE BOM FINISH N/A N/A SHEET SIZE: B SCALE: 1:33.
NOTS: RVSON STORY RV T SRPTON O Y //04 RLS OR PROUTON 433 P 34 55 033 OUMNT STTUS: NOT O PROPRTRY NORMTON TS OUMNT SLL NOT RPROU NOR SLL T NORMTON ONTN RN US Y OR SLOS TO OTR XPT S XPRSSLY UTORZ Y OR LT
More information22 t b r 2, 20 h r, th xp t d bl n nd t fr th b rd r t t. f r r z r t l n l th h r t rl T l t n b rd n n l h d, nd n nh rd f pp t t f r n. H v v d n f
n r t d n 20 2 : 6 T P bl D n, l d t z d http:.h th tr t. r pd l 22 t b r 2, 20 h r, th xp t d bl n nd t fr th b rd r t t. f r r z r t l n l th h r t rl T l t n b rd n n l h d, nd n nh rd f pp t t f r
More information828.^ 2 F r, Br n, nd t h. n, v n lth h th n l nd h d n r d t n v l l n th f v r x t p th l ft. n ll n n n f lt ll th t p n nt r f d pp nt nt nd, th t
2Â F b. Th h ph rd l nd r. l X. TH H PH RD L ND R. L X. F r, Br n, nd t h. B th ttr h ph rd. n th l f p t r l l nd, t t d t, n n t n, nt r rl r th n th n r l t f th f th th r l, nd d r b t t f nn r r pr
More informationConvergence Theorems for Two Iterative Methods. A stationary iterative method for solving the linear system: (1.1)
Conrgnc Thors for Two Itrt Mthods A sttonry trt thod for solng th lnr syst: Ax = b (.) ploys n trton trx B nd constnt ctor c so tht for gn strtng stt x of x for = 2... x Bx c + = +. (.2) For such n trton
More informationThe R-Tree. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland
Yu To ITEE Unvrsty o Qunsln W wll stuy nw strutur ll t R-tr, w n tout o s mult-mnsonl xtnson o t B-tr. T R-tr supports ntly vrty o qurs (s w wll n out ltr n t ours), n s mplmnt n numrous ts systms. Our
More informationFunctions and Graphs 1. (a) (b) (c) (f) (e) (d) 2. (a) (b) (c) (d)
Functions nd Grps. () () (c) - - - O - - - O - - - O - - - - (d) () (f) - - O - 7 6 - - O - -7-6 - - - - - O. () () (c) (d) - - - O - O - O - - O - -. () G() f() + f( ), G(-) f( ) + f(), G() G( ) nd G()
More informationb.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V, " = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =?
xmpl : An 8-gug oppr wr hs nomnl mtr o. mm. Ths wr rrs onstnt urrnt o.67 A to W lmp. Th nsty o r ltrons s 8.5 x 8 ltrons pr u mtr. Fn th mgntu o. th urrnt nsty. th rt vloty xmpl D. mm,.67 A, n N 8.5" 8
More informationA general N-dimensional vector consists of N values. They can be arranged as a column or a row and can be real or complex.
Lnr lgr Vctors gnrl -dmnsonl ctor conssts of lus h cn rrngd s column or row nd cn rl or compl Rcll -dmnsonl ctor cn rprsnt poston, loct, or cclrton Lt & k,, unt ctors long,, & rspctl nd lt k h th componnts
More informationCSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2
Am Blnk Ltur 0 Autumn 0 CSE 33: Dt Astrtons CSE 33 Grps : Wt s Grp? DFS n BFS Dt Astrtons LnkLsts r to Trs s Trs r to... A Grp s Tny... Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus, Hps, Vnll Trs,
More informationMATERIAL SEE BOM ANGLES = 2 > 2000 DATE MEDIUM FINISH
NOTS:. LN MTN SUR WT NTUR/SOPROPYL LOOL PROR TO RN L OR LOO. PPLY LOTT 4 ON TRS. TORQU TO. Nm / 00 lb-in 4. TORQU TO 45-50 Nm / - lb-ft 5. TORQU TO Nm / 4.5 lb-ft. TORQU TO 0 Nm / lb-in. TORQU TO 5.5 Nm
More informationFilter Design Techniques
Fltr Dsgn chnqus Fltr Fltr s systm tht psss crtn frquncy componnts n totlly rcts ll othrs Stgs of th sgn fltr Spcfcton of th sr proprts of th systm ppromton of th spcfcton usng cusl scrt-tm systm Rlzton
More information16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am
16.unii Introution to Computrs n Prormmin SOLUTIONS to Exmintion /30/0 9:05m - 10:00m Pro. I. Kristin Lunqvist Sprin 00 Grin Stion: Qustion 1 (5) Qustion (15) Qustion 3 (10) Qustion (35) Qustion 5 (10)
More informationPriority Search Trees - Part I
.S. 252 Pro. Rorto Taassa oputatoal otry S., 1992 1993 Ltur 9 at: ar 8, 1993 Sr: a Q ol aro Prorty Sar Trs - Part 1 trouto t last ltur, w loo at trval trs. or trval pot losur prols, ty us lar spa a optal
More informationHumanistic, and Particularly Classical, Studies as a Preparation for the Law
University of Michigan Law School University of Michigan Law School Scholarship Repository Articles Faculty Scholarship 1907 Humanistic, and Particularly Classical, Studies as a Preparation for the Law
More informationECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS
C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h
More information