Orthogonal vector coloring
type: Item
instance of: scholarly article
title: Orthogonal vector coloring
zbMATH Open document ID: 1215.05066
author: Gerald Haynes
author: Catherine Park
author: Amanda Schaeffer
author: Lon H. Mitchell
author: Jordan D. Webster
published in: The Electronic Journal of Combinatorics
publication date: 2010-06-16T00:00:00Z
full work available at URL: https://eudml.org/doc/233268
full work available at URL: v17i1r55.html
review text: Summary: 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.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5721449
zbMATH Keywords: chromatic numbers
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5721449