On Orthogonal Vector Edge Coloring

arXiv1909.01918MaRDI QIDQ6324686FDOQ6324686

Authors: Ana Silva, Allen Ibiapina 

Publication date: 4 September 2019

Abstract: Given a graph $G$ and a positive integer $d$, an orthogonal vector $d$-coloring of $G$ is an assignment $f$ of vectors of $mathbb{R}^d$ to $V(G)$ in such a way that adjacent vertices receive orthogonal vectors. The orthogonal chromatic number of $G$, denoted by $ch{i}_v(G)$, is the minimum $d$ for which $G$ admits an orthogonal vector $d$-coloring. This notion has close ties with the notions of Lov'asz Theta Function, quantum chromatic number, and many other problems, and even though this and related metrics have been extensively studied over the years, we have found that there is a gap in the knowledge concerning the edge version of the problem. In this article, we discuss this version and its relation with other insteresting known facts, and pose a question about the orthogonal chromatic index of cubic graphs.

This page was built for publication: On Orthogonal Vector Edge Coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6324686)