The following pages link to (Q3832590):
Displayed 11 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)
- 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)
- Coloring a set of touching strings (Q2851465) (← links)
- Ramsey-type constructions for arrangements of segments (Q5301021) (← links)