Geodesic
Orthogonal vector coloring
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A vector coloring of a graph is an assignment of a vector to each vertex where the presence or absence of an edge between two vertices dictates the value of the inner product of the corresponding vectors. In this paper, we obtain results on orthogonal vector coloring, where adjacent vertices must be assigned orthogonal vectors. We introduce two vector analogues of list coloring along with their chromatic numbers and characterize all graphs that have (vector) chromatic number two in each case.
DOI : 10.37236/327
Classification : 05C15
Mots-clés : chromatic numbers 
@article{10_37236_327,
     author = {Gerald Haynes and Catherine Park and Amanda Schaeffer and Jordan Webster and Lon H. Mitchell},
     title = {Orthogonal vector coloring},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/327},
     zbl = {1215.05066},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/327/}
}
TY  - JOUR
AU  - Gerald Haynes
AU  - Catherine Park
AU  - Amanda Schaeffer
AU  - Jordan Webster
AU  - Lon H. Mitchell
TI  - Orthogonal vector coloring
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/327/
DO  - 10.37236/327
ID  - 10_37236_327
ER  - 
%0 Journal Article
%A Gerald Haynes
%A Catherine Park
%A Amanda Schaeffer
%A Jordan Webster
%A Lon H. Mitchell
%T Orthogonal vector coloring
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/327/
%R 10.37236/327
%F 10_37236_327
Gerald Haynes; Catherine Park; Amanda Schaeffer; Jordan Webster; Lon H. Mitchell. Orthogonal vector coloring. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/327

Cité par Sources :