On a Coloring Problem.
From MaRDI portal
Cited in
(61)- On the chromatic number of multiple interval graphs and overlap graphs
- Covering and coloring problems for relatives of intervals
- Intersection properties of boxes. I: An upper-bound theorem
- 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
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- On bounding the chromatic number of L-graphs
- Local boxicity
- Coloring Hasse diagrams and disjointness graphs of curves
- Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
- Coloring curves that cross a fixed curve
- Improved algorithms for scheduling unsplittable flows on paths
- Coloring a set of touching strings
- Coloring and maximum independent set of rectangles
- Triangle-free geometric intersection graphs with large chromatic number
- Triangle-free intersection graphs of line segments with large chromatic number
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Approximation algorithms for maximum independent set of pseudo-disks
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
- Orthogonal tree decompositions of graphs
- Coloring intersection graphs of arc-connected sets in the plane
- Coloring intersection graphs of \(x\)-monotone curves in the plane
- Hasse diagrams with large chromatic number
- On the chromatic number of disjointness graphs of curves
- A note on fractional coloring and the integrality gap of LP for maximum weight independent set
- scientific article; zbMATH DE number 7278054 (Why is no real title available?)
- Box and Segment Intersection Graphs with Large Girth and Chromatic Number
- Better bounds for poset dimension and boxicity
- Outerstring graphs are -bounded
- Decomposition of Multiple Packings with Subquadratic Union Complexity
- Disjointness graphs of segments in the space
- Burling graphs, chromatic number, and orthogonal tree-decompositions
- Burling graphs, chromatic number, and orthogonal tree-decompositions
- Coloring polygon visibility graphs and their generalizations
- Ramsey numbers of semi-algebraic and semi-linear hypergraphs
- 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
- Annulus graphs in \(\mathbb{R}^d\)
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
- Reuniting -boundedness with polynomial -boundedness
- The -binding function of d-directional segment graphs
- Graphs of bounded chordality
- Coloring translates and homothets of a convex body
- Semi-algebraic and semi-linear Ramsey numbers (extended abstract)
- Chromatic number of intersection graphs of segments with two slopes (extended abstract)
- On-line approach to off-line coloring problems on graphs with geometric representations
- Colouring polygon visibility graphs and their generalizations
- Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity
- Coloring non-crossing strings
- Polynomial-time recognition and maximum independent set in Burling graphs
- On the chromatic number of disjointness graphs of curves
- On the stab number of rectangle intersection graphs
- Coloring the complements of intersection graphs of geometric figures
This page was built for publication: On a Coloring Problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3272975)
