Pages that link to "Item:Q1917502"
From MaRDI portal
The following pages link to A triangle-free circle graph with chromatic number 5 (Q1917502):
Displaying 9 items.
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- Independent sets and chromatic numbers of circle graphs (Q906759) (← links)
- Every circle graph of girth at least 5 is 3-colourable (Q1296984) (← links)
- An upper bound on the chromatic number of a circle graph without \(K_4\) (Q1930220) (← links)
- On fixed-order book thickness parameterized by the pathwidth of the vertex ordering (Q2039665) (← links)
- Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis (Q2110740) (← links)
- Coloring circle graphs (Q3503503) (← links)
- Circle graphs are quadratically χ‐bounded (Q5006380) (← links)
- Improved bounds for colouring circle graphs (Q5039236) (← links)
