Sabidussi versus Hedetniemi for three variations of the chromatic number
DOI10.1007/s00493-014-3132-1zbMath1389.05040arXiv1305.5545OpenAlexW2044987315MaRDI QIDQ1677539
Robert Šámal, David E. Roberson, Simone Severini, Chris D. Godsil
Publication date: 10 November 2017
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.5545
chromatic numberCartesian productquantum chromatic numbercategorical productstrict vector chromatic numbervector chromatic number
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)
Related Items (10)
Cites Work
- The fractional version of Hedetniemi's conjecture is true
- On the quantum chromatic number of a graph
- Equiarboreal graphs
- The sandwich theorem
- Vertex-transitive graphs
- New Separations in Zero-Error Channel Capacity Through Projective Kochen–Specker Sets and Quantum Coloring
- Forbidden Intersections
- Approximate graph coloring by semidefinite programming
- A comparison of the Delsarte and Lovász bounds
- On the Shannon capacity of a graph
- Kochen–Specker Sets and the Rank-1 Quantum Chromatic Number
- Computational Complexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sabidussi versus Hedetniemi for three variations of the chromatic number