Vector colorability
type: Item
instance of: scholarly article
title: Vector colorability
zbMATH Open document ID: 0641.05017
DOI: 10.1016/0024-3795(87)90079-6
author: J. A. Dias Da Silva
author: Amélia Fonseca
published in: Linear Algebra and its Applications
publication date: 1987-01-01T00:00:00Z
review text: A coloring of a family of vectors is an assignment of a color to each vector so that color classes are linearly independent. The authors define a graph associated with a colored family of vectors. The family is planar if there exists a coloring which yields a planar associated graph. The authors show that a planar family of vectors is 4-colorable. Two proofs are given, one using the 4-color Theorem for graphs, and the other not.
reviewed by: Dan S. Archdeacon
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 15A03
zbMATH DE Number: 4043861
zbMATH Keywords: planarity
zbMATH Keywords: vectors
zbMATH Keywords: coloring
MaRDI profile type: Publication
full work available at URL: 0024-3795(87)90079-6
OpenAlex ID: W4245994244
cites work: Every planar map is four colorable
cites work: On the multilinearity partition of an irreducible character
cites work: Some partitions associated with a partially ordered set
cites work: An extension of Schensted's theorem
cites work: The structure of Sperner k-families
cites work: Strong versions of Sperner's theorem
description: scientific article; zbMATH DE number 4043861