A class of intersection graph of half-lines and of line segments in the plane
The intersection graph of a non-empty family L of line segments in the plane, denoted by (L), is defined as the graph whose vertex-set is L, where there is an edge between two vertices `1 and `2 in L if `1 \ `2 6= . If L is a family of half-lines, (L) is called a half-line intersection graph. We de...
Saved in:
主要作者: | |
---|---|
格式: | text |
語言: | English |
出版: |
Animo Repository
2009
|
主題: | |
在線閱讀: | https://animorepository.dlsu.edu.ph/etd_doctoral/238 https://animorepository.dlsu.edu.ph/context/etd_doctoral/article/1237/viewcontent/CDTG004564_P.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|