3-coloring arrangements of line segments with 4 slopes is hard
type: Item
instance of: scholarly article
title: 3-coloring arrangements of line segments with 4 slopes is hard
zbMATH Open document ID: 1478.68212
author: Patrizio Angelini
author: Giordano Da Lozzo
published in: Information Processing Letters
publication date: 2018-06-15T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 52C30
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 6889958
zbMATH Keywords: intersection graphs
zbMATH Keywords: 3-colorability
zbMATH Keywords: computational complexity
zbMATH Keywords: planar stratification of geometric graph drawings
zbMATH Keywords: constrained geometric thickness
MaRDI profile type: Publication
full work available at URL: j.ipl.2018.05.002
OpenAlex ID: W2804464011
Wikidata QID: Q62046541
cites work: On a Coloring Problem.
cites work: On coloring unit disk graphs
cites work: Q5501348
cites work: Coloring intersection graphs of arc-connected sets in the plane
cites work: Coloring intersection graphs of \(x\)-monotone curves in the plane
cites work: Topics in Intersection Graph Theory
cites work: Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs
cites work: A unified approach to visibility representations of planar graphs
cites work: Rectilinear planar layouts and bipolar orientations of planar graphs
cites work: Q4198056
DOI: 10.1016/J.IPL.2018.05.002
description: scientific article; zbMATH DE number 6889958