?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=Thickness+of+Bar+1-Visibility+Graphs&rft.creator=Massow%2C+Mareike&rft.creator=Felsner%2C+Stefan&rft.subject=P.900+Visibility&rft.subject=Z.999+Others&rft.description=Bar+k-visibility+graphs+are+graphs+admitting+a+representation+in%0D%0Awhich+the+vertices+correspond+to+horizontal+line+segments%2C+called%0D%0Abars%2C+and+the+edges+correspond+to+vertical+lines+of+sight+which+can%0D%0Atraverse+up+to+k+bars.+These+graphs+were+introduced+by+Dean+et%0D%0Aal.+[3]+who+conjectured+that+bar+1-visibility+graphs+have%0D%0Athickness+at+most+2.+We+construct+a+bar+1-visibility+graph+having%0D%0Athickness+3%2C+disproving+their+conjecture.+For+a+special+case+of+bar%0D%0A1-visibility+graphs+we+present+an+algorithm+partitioning+the+edges%0D%0Ainto+two+plane+graphs%2C+showing+that+for+this+class+the+thickness+is%0D%0Aindeed+bounded+by+2.%0D%0A++++&rft.publisher=Springer&rft.contributor=Kaufmann%2C+Michael&rft.contributor=Wagner%2C+Dorothea&rft.date=2007&rft.type=Conference+Paper&rft.type=NonPeerReviewed&rft.identifier=Massow%2C+Mareike+and+Felsner%2C+Stefan+(2007)+Thickness+of+Bar+1-Visibility+Graphs.+[Conference+Paper]&rft.relation=http%3A%2F%2Fgdea.informatik.uni-koeln.de%2F787%2F