The Operator \Psi for the Chromatic Number of a Graph
From MaRDI portal
The Operator $\Psi$ for the Chromatic Number of a Graph
Recommendations
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Chromatic Gallai identities operating on Lovász number
- A semidefinite programming-based heuristic for graph coloring
- Approximate graph coloring by semidefinite programming
Cited in
(36)- The Maximum k-Colorable Subgraph Problem and Related Problems
- Chromatic Gallai identities operating on Lovász number
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- Dynamic coloring of graphs having no \(K_5\) minor
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Representation of zeros of a copositive matrix via maximal cliques of a graph
- On the computational complexity of membership problems for the completely positive cone and its dual
- Spotting trees with few leaves
- Algebras, graphs and thetas
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Spotting trees with few leaves
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Copositive optimization -- recent developments and applications
- Matrix relaxations in combinatorial optimization
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Copositivity and constrained fractional quadratic problems
- Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
- Completely positive reformulations for polynomial optimization
- Semidefinite and linear programming integrality gaps for scheduling identical machines
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Computational complexity of sum-of-squares bounds for copositive programs
- Collective dynamics of phase-repulsive oscillators solves graph coloring problem
- On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
- Semidefinite and linear programming integrality gaps for scheduling identical machines
- Convex relaxations and integrality gaps
- Copositive programming
- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming
- An axiomatic duality framework for the theta body and related convex corners
- Colorings of complements of line graphs
- Invariant Semidefinite Programs
- Copositive matrices, sums of squares and the stability number of a graph
This page was built for publication: The Operator $\Psi$ for the Chromatic Number of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629507)
