scientific article; zbMATH DE number 2145236
From MaRDI portal
Publication:4657585
Recommendations
- Bounds on the chromatic number of intersection graphs of sets in the plane
- On the chromatic number of intersection graphs of convex sets in the plane
- Triangle-free geometric intersection graphs with large chromatic number
- Coloring relatives of intervals on the plane. I: Chromatic number versus girth
- Geometric graphs
Cited in
(37)- Crossings, colorings, and cliques
- Covering and coloring problems for relatives of intervals
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- Bounds on the chromatic number of intersection graphs of sets in the plane
- On the chromatic number of intersection graphs of convex sets in the plane
- An upper bound on the chromatic number of a circle graph without \(K_4\)
- Lower bounds for boxicity
- Coloring curves that cross a fixed curve
- Improved algorithms for scheduling unsplittable flows on paths
- Cubicity of interval graphs and the claw number
- Coloring and maximum independent set of rectangles
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Tangencies between families of disjoint regions in the plane
- Coloring intersection graphs of arc-connected sets in the plane
- Improved Ramsey-type results for comparability graphs
- Circle graphs are quadratically χ‐bounded
- On the chromatic number of disjointness graphs of curves
- scientific article; zbMATH DE number 7278054 (Why is no real title available?)
- Zarankiewicz's problem for semilinear hypergraphs
- Box and Segment Intersection Graphs with Large Girth and Chromatic Number
- Outerstring graphs are -bounded
- Coloring Jordan regions and curves
- Decomposition of Multiple Packings with Subquadratic Union Complexity
- Disjointness graphs of segments in the space
- Turán-type results for intersection graphs of boxes
- Colouring arcwise connected sets in the plane. I
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded
- String graphs have the Erdős-Hajnal property
- Contact graphs of boxes with unidirectional contacts
- New formulation for coloring circle graphs
- A view from above on \(\mathrm{JN}_p( \mathbb{R}^n)\)
- Coloring translates and homothets of a convex body
- Vertex-minor-closed classes are -bounded
- Pivot-minors and the Erdős-Hajnal conjecture
- On-line approach to off-line coloring problems on graphs with geometric representations
- On the chromatic number of disjointness graphs of curves
- Coloring the complements of intersection graphs of geometric figures
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657585)
