Pages that link to "Item:Q4806594"
From MaRDI portal
The following pages link to Coloring -colorable graphs using relatively small palettes (Q4806594):
Displaying 10 items.
- Computing the partition function for graph homomorphisms (Q681595) (← links)
- Wireless capacity with arbitrary gain matrix (Q742412) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- (Q5092401) (← links)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- Linear Index Coding via Semidefinite Programming (Q5410256) (← links)
- (Q5743408) (← links)
- (Q5870293) (← links)
