The following pages link to (Q4657585):
Displaying 28 items.
- Structural parameterizations for boxicity (Q289935) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Tangencies between families of disjoint regions in the plane (Q427060) (← 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)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- Coloring the complements of intersection graphs of geometric figures (Q941403) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- An upper bound on the chromatic number of a circle graph without \(K_4\) (Q1930220) (← links)
- Lower bounds for boxicity (Q2341923) (← links)
- Coloring curves that cross a fixed curve (Q2415382) (← links)
- Improved algorithms for scheduling unsplittable flows on paths (Q2684488) (← links)
- Cubicity of interval graphs and the claw number (Q3061191) (← links)
- Coloring and Maximum Independent Set of Rectangles (Q3088088) (← links)
- Improved Ramsey-type results for comparability graphs (Q4987258) (← links)
- Circle graphs are quadratically χ‐bounded (Q5006380) (← links)
- (Q5088986) (← links)
- (Q5136269) (← links)
- Zarankiewicz’s problem for semilinear hypergraphs (Q5154785) (← links)
- Box and Segment Intersection Graphs with Large Girth and Chromatic Number (Q5162871) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Coloring Jordan Regions and Curves (Q5348217) (← links)
- Decomposition of Multiple Packings with Subquadratic Union Complexity (Q5364271) (← links)
- Disjointness graphs of segments in the space (Q5886095) (← links)
- Turán-type results for intersection graphs of boxes (Q5886122) (← links)
- Colouring arcwise connected sets in the plane. I (Q5935603) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
- String graphs have the Erdős-Hajnal property (Q6192228) (← links)
