The following pages link to (Q3832590):
Displaying 22 items.
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes (Q463287) (← links)
- Bounds for chromatic number in terms of even-girth and booksize (Q616000) (← links)
- Ramsey-type constructions for arrangements of segments (Q661941) (← links)
- Coloring non-crossing strings (Q727171) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- On the maximum diameter of \(k\)-colorable graphs (Q820842) (← links)
- Independent sets and chromatic numbers of circle graphs (Q906759) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- Every circle graph of girth at least 5 is 3-colourable (Q1296984) (← links)
- Covering and coloring polygon-circle graphs (Q1356563) (← links)
- The total chromatic number of any multigraph with maximum degree five is at most seven (Q1356668) (← links)
- A triangle-free circle graph with chromatic number 5 (Q1917502) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- Coloring curves that cross a fixed curve (Q2415382) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Coloring a set of touching strings (Q2851465) (← links)
- Circle graphs are quadratically χ‐bounded (Q5006380) (← links)
- Improved bounds for colouring circle graphs (Q5039236) (← links)
- (Q5088986) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Ramsey-type constructions for arrangements of segments (Q5301021) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
