Pages that link to "Item:Q5935603"
From MaRDI portal
The following pages link to Colouring arcwise connected sets in the plane. I (Q5935603):
Displaying 25 items.
- Triangle-free intersection graphs of line segments with large chromatic number (Q401487) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Coloring intersection graphs of arc-connected sets in the plane (Q464743) (← links)
- Coloring intersection graphs of \(x\)-monotone curves in the plane (Q485004) (← links)
- Coloring non-crossing strings (Q727171) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- New bounds on the maximum number of edges in \(k\)-quasi-planar graphs (Q904085) (← links)
- Colouring relatives of intervals on the plane. II: Intervals and rays in two directions (Q1348767) (← links)
- Coloring relatives of intervals on the plane. I: Chromatic number versus girth (Q1378297) (← links)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- Arcwise connected domains, quasiconformal mappings, and quasidisks (Q1724091) (← links)
- Bounds on the chromatic number of intersection graphs of sets in the plane (Q1868853) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors (Q2256590) (← links)
- Triangle-free geometric intersection graphs with no large independent sets (Q2256591) (← links)
- Coloring curves that cross a fixed curve (Q2415382) (← links)
- Coloring a set of touching strings (Q2851465) (← links)
- Improved Ramsey-type results for comparability graphs (Q4987258) (← links)
- Quantitative Restrictions on Crossing Patterns (Q5001654) (← links)
- (Q5088986) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
- Coloring triangle-free L-graphs with \(O (\log \log n)\) colors (Q6181998) (← links)
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem (Q6563995) (← links)
- Coloring triangle-free L-graphs with \(O(\log\log n)\) colors (Q6621266) (← links)
