| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6874146 | Information Processing Letters | 2018 | 4 Pages |
Abstract
Since the problem of computing a k-coloring of an arrangement of line segments is equivalent to computing the constrained geometric thickness of a straight-line drawing of a graph in the plane, our result extends to this problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Patrizio Angelini, Giordano Da Lozzo,