Vector colorability (Q1100473)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Vector colorability |
scientific article; zbMATH DE number 4043861
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vector colorability |
scientific article; zbMATH DE number 4043861 |
Statements
Vector colorability (English)
0 references
1987
0 references
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.
0 references
planarity
0 references
vectors
0 references
coloring
0 references
