Pages that link to "Item:Q290195"
From MaRDI portal
The following pages link to An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195):
Displayed 6 items.
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757) (← links)
- On-line coloring \(k\)-colorable graphs (Q1264277) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- New Tools for Graph Coloring (Q3088076) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)
