Pages that link to "Item:Q464743"

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

Displaying 10 items.

• 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)
• 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)
• Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
• Coloring triangle-free L-graphs with \(O (\log \log n)\) colors (Q6181998) (← links)