scientific article; zbMATH DE number 6789207
From MaRDI portal
Publication:5368703
DOI10.4230/LIPIcs.SOCG.2015.421zbMath1378.68174MaRDI QIDQ5368703
Klaus Kriegel, Max Willert, Frank Hoffmann, Kevin Verbeek, Subhash Suri
Publication date: 10 October 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hypergraphs (05C65) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Conflict-Free Coloring of Graphs ⋮ Conflict-Free Coloring of Intersection Graphs ⋮ On colourability of polygon visibility graphs ⋮ On Colourability of Polygon Visibility Graphs ⋮ Unnamed Item
