Pages that link to "Item:Q722314"
From MaRDI portal
The following pages link to On-line approach to off-line coloring problems on graphs with geometric representations (Q722314):
Displaying 15 items.
- Triangle-free geometric intersection graphs with large chromatic number (Q377499) (← links)
- On-line coloring of geometric intersection graphs (Q1862127) (← 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)
- Online and quasi-online colorings of wedges and intervals (Q2520715) (← links)
- Circle graphs are quadratically χ‐bounded (Q5006380) (← links)
- Improved bounds for colouring circle graphs (Q5039236) (← links)
- Box and Segment Intersection Graphs with Large Girth and Chromatic Number (Q5162871) (← 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)
- Online coloring of short intervals (Q6201896) (← 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)
