Vector colorability

DOI10.1016/0024-3795(87)90079-6MaRDI QIDQ1100473zbMATH OpenOpenAlexFDO

Authors J. A. Dias Da Silva, Amélia Fonseca

Publication date 1987

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(87)90079-6

zbMATH Keywords

coloringplanarityvectors

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vector spaces, linear dependence, rank, lineability (15A03)

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.

Recommendations

• On the coloring of maximal planar graphs
• Orthogonal vector coloring
• Publication:4890134
• scientific article; zbMATH DE number 599411
• scientific article; zbMATH DE number 4023314

Cites work

• An extension of Schensted's theorem
• Every planar map is four colorable
• On the multilinearity partition of an irreducible character
• Some partitions associated with a partially ordered set
• Strong versions of Sperner's theorem
• The structure of Sperner k-families

Cited in

(6)

• On the coloring of maximal planar graphs
• On the multilinearity partition of an irreducible character II
• Amenable colorings
• Amenable colorings
• Between 2- and 3-colorability
• Orthogonal vector coloring

This page was built for publication: Vector colorability

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