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):
Displaying 30 items.
- Hardness and algorithms for rainbow connection (Q491198) (← links)
- Improved edge-coloring with three colors (Q837164) (← links)
- 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)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- Dominating set based exact algorithms for \(3\)-coloring (Q1944084) (← links)
- Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 (Q2028085) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. (Q2768314) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs (Q2927657) (← links)
- Coloring 3-colorable graphs with o(n 1/5 ) colors (Q2965508) (← 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)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- New Tools for Graph Coloring (Q3088076) (← links)
- (Q4784290) (← links)
- (Q5092401) (← links)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- Finding Pseudorandom Colorings of Pseudorandom Graphs (Q5136329) (← links)
- Linear Index Coding via Semidefinite Programming (Q5410256) (← links)
- (Q5743408) (← links)
- (Q5870293) (← links)
- (Q5875482) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
- Deciding 3-colourability in less than O(1.415n) steps (Q6143975) (← links)
