Coloring -colorable graphs using relatively small palettes
From MaRDI portal
Recommendations
Cited in
(19)- Coloring graphs having few colorings over path decompositions
- Hardness of rainbow coloring hypergraphs
- Computing the partition function for graph homomorphisms
- Linear index coding via semidefinite programming
- Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7
- scientific article; zbMATH DE number 7561683 (Why is no real title available?)
- Coloring \(k\)-colorable graphs using smaller palettes
- scientific article; zbMATH DE number 764415 (Why is no real title available?)
- Wireless capacity with arbitrary gain matrix
- Almost all k-colorable graphs are easy to color
- Linear index coding via semidefinite programming
- Approximating the orthogonality dimension of graphs and hypergraphs
- Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Coloring 3-colorable graphs with less than \(n^{1/5}\) colors
- Convex relaxations and integrality gaps
- Coloring 3-colorable graphs with \(o(n^{1/5})\) colors
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
This page was built for publication: Coloring -colorable graphs using relatively small palettes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806594)