Pages that link to "Item:Q2256590"

The following pages link to Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors (Q2256590):

Displaying 12 items.

• Restricted frame graphs and a conjecture of Scott (Q252837) (← links)
• On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
• Conflict-free coloring of string graphs (Q2022631) (← links)
• Coloring curves that cross a fixed curve (Q2415382) (← links)
• Burling graphs revisited. I: New characterizations (Q2700996) (← links)
• Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
• Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
• Burling graphs revisited. III: Applications to \(\chi \)-boundedness (Q6146493) (← links)
• Ramsey properties of semilinear graphs (Q6161733) (← links)
• Coloring triangle-free L-graphs with \(O (\log \log n)\) colors (Q6181998) (← links)
• Coloring lines and Delaunay graphs with respect to boxes (Q6201036) (← links)
• Coloring triangle-free L-graphs with \(O(\log\log n)\) colors (Q6621266) (← links)