scientific article; zbMATH DE number 6469229
From MaRDI portal
Publication:5501348
zbMath1318.05078MaRDI QIDQ5501348
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
3-coloring arrangements of line segments with 4 slopes is hard ⋮ Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs ⋮ Edges and switches, tunnels and bridges
This page was built for publication:
