scientific article; zbMATH DE number 1185595

MaRDI QIDQ3838403zbMATH OpenFDO

Authors Eric Phelps

Publication date 11 January 1999

zbMATH Keywords

adjacency matrixblock coversboolean rankcoloringfactor rankvertex clique cover numberweakly factor perfect matrices

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Graph coloring and semidefinite rank
• scientific article; zbMATH DE number 2076918
• Rank and chromatic number of a graph
• scientific article; zbMATH DE number 6605085
• scientific article; zbMATH DE number 817188
• Coloring and domination in graphs
• scientific article; zbMATH DE number 1303029
• Graph colorings
• The coloring of graphs
• Conditional colorings of graphs

Cited in

(6)

• Realizable problems of Boolean matrices and the relations between realizable Boolean matrices and chromatic number of graphs
• scientific article; zbMATH DE number 3891428 (Why is no real title available?)
• scientific article; zbMATH DE number 3983193 (Why is no real title available?)
• scientific article; zbMATH DE number 1303029 (Why is no real title available?)
• Clique covers of graphs and ranks of Boolean matrices
• On minimally non-firm binary matrices

This page was built for publication:

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