Coloring curves that cross a fixed curve
From MaRDI portal
(Redirected from Coloring curves that cross a fixed curve)
Recommendations
- Coloring curves that cross a fixed curve
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Coloring k k -free intersection graphs of geometric objects in the plane
- Coloring intersection graphs of \(x\)-monotone curves in the plane
- On the chromatic number of disjointness graphs of curves
Cites work
- Applications of a new separator theorem for string graphs
- Applications of the crossing number
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Coloring intersection graphs of \(x\)-monotone curves in the plane
- Coloring intersection graphs of arc-connected sets in the plane
- Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
- Colouring arcwise connected sets in the plane. I
- Colouring arcwise connected sets in the plane. II
- Covering and coloring polygon-circle graphs
- scientific article; zbMATH DE number 4108789 (Why is no real title available?)
- scientific article; zbMATH DE number 2145236 (Why is no real title available?)
- scientific article; zbMATH DE number 5037083 (Why is no real title available?)
- Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures
- Near-optimal separators in string graphs
- On a Coloring Problem.
- On bounding the chromatic number of L-graphs
- On the chromatic number of multiple interval graphs and overlap graphs
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- On-line approach to off-line coloring problems on graphs with geometric representations
- Outerstring graphs are \(\chi\)-bounded
- Quasi-planar graphs have a linear number of edges
- Research Problems in Discrete Geometry
- The number of edges in k-quasi-planar graphs
- Triangle-free geometric intersection graphs with large chromatic number
- Triangle-free intersection graphs of line segments with large chromatic number
Cited in
(15)- On dominating set of some subclasses of string graphs
- Coloring k k -free intersection graphs of geometric objects in the plane
- Coloring curves that cross a fixed curve
- Outerstring graphs are \(\chi\)-bounded
- Coloring intersection graphs of \(x\)-monotone curves in the plane
- Quantitative restrictions on crossing patterns
- Quasi-planar Graphs
- Improved bounds for colouring circle graphs
- Outerstring graphs are -bounded
- Coloring polygon visibility graphs and their generalizations
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Coloring triangle-free L-graphs with \(O (\log \log n)\) colors
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Coloring triangle-free L-graphs with O( n) colors
- Colouring polygon visibility graphs and their generalizations
This page was built for publication: Coloring curves that cross a fixed curve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2415382)
