The following pages link to On a Coloring Problem. (Q3272975):
Displaying 36 items.
- Structural parameterizations for boxicity (Q289935) (← links)
- Triangle-free geometric intersection graphs with large chromatic number (Q377499) (← links)
- Triangle-free intersection graphs of line segments with large chromatic number (Q401487) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes (Q463287) (← links)
- Coloring intersection graphs of arc-connected sets in the plane (Q464743) (← links)
- Coloring intersection graphs of \(x\)-monotone curves in the plane (Q485004) (← links)
- A note on fractional coloring and the integrality gap of LP for maximum weight independent set (Q510956) (← links)
- Coloring translates and homothets of a convex body (Q695002) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- Coloring non-crossing strings (Q727171) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- On the stab number of rectangle intersection graphs (Q778517) (← links)
- Coloring the complements of intersection graphs of geometric figures (Q941403) (← links)
- On the chromatic number of multiple interval graphs and overlap graphs (Q1061131) (← links)
- Covering and coloring problems for relatives of intervals (Q1061132) (← links)
- Intersection properties of boxes. I: An upper-bound theorem (Q1107826) (← links)
- Colouring relatives of intervals on the plane. II: Intervals and rays in two directions (Q1348767) (← links)
- 3-coloring arrangements of line segments with 4 slopes is hard (Q1641160) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- Hasse diagrams with large chromatic number (Q5006387) (← links)
- (Q5088986) (← links)
- (Q5136269) (← links)
- Box and Segment Intersection Graphs with Large Girth and Chromatic Number (Q5162871) (← links)
- Better bounds for poset dimension and boxicity (Q5217895) (← links)
- Coloring polygon visibility graphs and their generalizations (Q6038590) (← links)
- Ramsey numbers of semi-algebraic and semi-linear hypergraphs (Q6051048) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
- Disjointness graphs of short polygonal chains (Q6144392) (← links)
- Ramsey properties of semilinear graphs (Q6161733) (← links)
- Coloring triangle-free L-graphs with \(O (\log \log n)\) colors (Q6181998) (← links)
- Lower bounds for piercing and coloring boxes (Q6187716) (← links)
- Graphs of large chromatic number (Q6198641) (← links)
- Coloring lines and Delaunay graphs with respect to boxes (Q6201036) (← links)
- Recognizing geometric intersection graphs stabbed by a line (Q6204544) (← links)
