Coloring intersection graphs of arc-connected sets in the plane
From MaRDI portal
Publication:464743
Abstract: A family of sets in the plane is simple if the intersection of its any subfamily is arc-connected, and it is pierced by a line if the intersection of its any member with is a nonempty segment. It is proved that the intersection graphs of simple families of compact arc-connected sets in the plane pierced by a common line have chromatic number bounded by a function of their clique number.
Recommendations
- Coloring intersection graphs of arcwise connected sets in the plane
- Colouring arcwise connected sets in the plane. II
- Colouring arcwise connected sets in the plane. I
- Coloring the complements of intersection graphs of geometric figures
- scientific article; zbMATH DE number 1990715
- Coloring intersection graphs of \(x\)-monotone curves in the plane
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Coloring k k -free intersection graphs of geometric objects in the plane
- scientific article; zbMATH DE number 2145236
- On the chromatic number of intersection graphs of convex sets in the plane
Cites work
- A separator theorem for string graphs and its applications
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Coloring intersection graphs of \(x\)-monotone curves in the plane
- Colouring arcwise connected sets in the plane. I
- Corrigendum
- Covering and coloring polygon-circle graphs
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- On a Coloring Problem.
- On bounding the chromatic number of L-graphs
- On the chromatic number of intersection graphs of convex sets in the plane
- On the chromatic number of multiple interval graphs and overlap graphs
- Outerstring graphs are \(\chi\)-bounded
- Sur le coloriage des graphs
- Triangle-free geometric intersection graphs with large chromatic number
- Triangle-free intersection graphs of line segments with large chromatic number
Cited in
(21)- 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
- Conflict-free coloring of string graphs
- Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
- Coloring curves that cross a fixed curve
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- scientific article; zbMATH DE number 1341903 (Why is no real title available?)
- Coloring intersection graphs of \(x\)-monotone curves in the plane
- On the chromatic number of disjointness graphs of curves
- Outerstring graphs are -bounded
- Choice of the control variables of an isolated intersection by graph colouring
- Coloring Jordan regions and curves
- Coloring intersection graphs of arcwise connected sets in the plane
- Colouring arcwise connected sets in the plane. I
- Colouring arcwise connected sets in the plane. II
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded
- Proper colorability of segment intersection graphs
- Coloring triangle-free L-graphs with \(O (\log \log n)\) colors
- On coloring the arcs of biregular graphs
- On the chromatic number of disjointness graphs of curves
- Coloring the complements of intersection graphs of geometric figures
This page was built for publication: Coloring intersection graphs of arc-connected sets in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464743)
