On a Coloring Problem.

DOI10.7146/math.scand.a-10607zbMath0095.17002OpenAlexW13621767MaRDI QIDQ3272975

Edgar Asplund, Branko Grünbaum

Publication date: 1960

Published in: MATHEMATICA SCANDINAVICA (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/165747

zbMATH Keywords

topology

Related Items

Local boxicity ⋮ Disjointness graphs of segments in the space ⋮ Structural parameterizations for boxicity ⋮ Colouring relatives of intervals on the plane. II: Intervals and rays in two directions ⋮ 3-coloring arrangements of line segments with 4 slopes is hard ⋮ Intersection properties of boxes. I: An upper-bound theorem ⋮ On bounding the chromatic number of L-graphs ⋮ Homothetic polygons and beyond: maximal cliques in intersection graphs ⋮ Triangle-free geometric intersection graphs with large chromatic number ⋮ Coloring curves that cross a fixed curve ⋮ Coloring polygon visibility graphs and their generalizations ⋮ Ramsey numbers of semi-algebraic and semi-linear hypergraphs ⋮ Triangle-free intersection graphs of line segments with large chromatic number ⋮ Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane ⋮ Improved algorithms for scheduling unsplittable flows on paths ⋮ Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded ⋮ Disjointness graphs of short polygonal chains ⋮ Ramsey properties of semilinear graphs ⋮ Coloring triangle-free L-graphs with \(O (\log \log n)\) colors ⋮ Lower bounds for piercing and coloring boxes ⋮ Graphs of large chromatic number ⋮ Coloring lines and Delaunay graphs with respect to boxes ⋮ Recognizing geometric intersection graphs stabbed by a line ⋮ Decomposition of Multiple Packings with Subquadratic Union Complexity ⋮ Coloring Hasse diagrams and disjointness graphs of curves ⋮ Approximation algorithms for maximum independent set of pseudo-disks ⋮ On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes ⋮ Coloring intersection graphs of arc-connected sets in the plane ⋮ Coloring intersection graphs of \(x\)-monotone curves in the plane ⋮ Orthogonal Tree Decompositions of Graphs ⋮ Coloring the complements of intersection graphs of geometric figures ⋮ A note on fractional coloring and the integrality gap of LP for maximum weight independent set ⋮ Box and Segment Intersection Graphs with Large Girth and Chromatic Number ⋮ Coloring translates and homothets of a convex body ⋮ Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors ⋮ Unnamed Item ⋮ Burling graphs, chromatic number, and orthogonal tree-decompositions ⋮ On-line approach to off-line coloring problems on graphs with geometric representations ⋮ Coloring non-crossing strings ⋮ Better bounds for poset dimension and boxicity ⋮ Coloring and Maximum Independent Set of Rectangles ⋮ Unnamed Item ⋮ On the chromatic number of disjointness graphs of curves ⋮ On the stab number of rectangle intersection graphs ⋮ Outerstring Graphs are $\chi$-Bounded ⋮ Burling graphs, chromatic number, and orthogonal tree-decompositions ⋮ Coloring a set of touching strings ⋮ Hasse diagrams with large chromatic number ⋮ On the chromatic number of multiple interval graphs and overlap graphs ⋮ Covering and coloring problems for relatives of intervals