Pages that link to "Item:Q464743"

The following pages link to Coloring intersection graphs of arc-connected sets in the plane (Q464743):

Displaying 18 items.

• Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
• Coloring intersection graphs of \(x\)-monotone curves in the plane (Q485004) (← links)
• On coloring the arcs of biregular graphs (Q777426) (← 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)
• Coloring the complements of intersection graphs of geometric figures (Q941403) (← links)
• Colouring relatives of intervals on the plane. II: Intervals and rays in two directions (Q1348767) (← links)
• 3-coloring arrangements of line segments with 4 slopes is hard (Q1641160) (← links)
• Conflict-free coloring of string graphs (Q2022631) (← links)
• Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors (Q2256590) (← links)
• Coloring curves that cross a fixed curve (Q2415382) (← links)
• (Q5088986) (← links)
• Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
• Choice of the control variables of an isolated intersection by graph colouring (Q5278837) (← links)
• Colouring arcwise connected sets in the plane. I (Q5935603) (← links)
• Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
• Proper colorability of segment intersection graphs (Q6168981) (← links)
• Coloring triangle-free L-graphs with \(O (\log \log n)\) colors (Q6181998) (← links)