The Chromatic Number of the Disjointness Graph of the Double Chain
Let $P$ be a set of $n\geq 4$ points in general position in the plane. Consider all the closed straight line segments with both endpoints in $P$. Suppose that these segments are colored with the rule that disjoint segments receive different colors. In this paper we show that if $P$ is the point conf...
| Main Authors: | , , , |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
Discrete Mathematics & Theoretical Computer Science
2020-03-01
|
| 叢編: | Discrete Mathematics & Theoretical Computer Science |
| 主題: | |
| 在線閱讀: | https://dmtcs.episciences.org/4490/pdf |