Pages that link to "Item:Q2965508"
From MaRDI portal
The following pages link to Coloring 3-colorable graphs with o(n 1/5 ) colors (Q2965508):
Displaying 7 items.
- Distinguishing colorings of 3-connected planar graphs with five colors (Q2799604) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← links)
- New Tools for Graph Coloring (Q3088076) (← links)
- Finding Pseudorandom Colorings of Pseudorandom Graphs (Q5136329) (← links)
- Approximately coloring graphs without long induced paths (Q5915792) (← links)
- Deciding 3-colourability in less than O(1.415n) steps (Q6143975) (← links)