Realizable problems of Boolean matrices and the relations between realizable Boolean matrices and chromatic number of graphs

MaRDI QIDQ3071841zbMATH OpenFDO

Authors Yan Yang, Xueping Wang

Publication date 5 February 2011

zbMATH Keywords

chromatic numbercontentsimple graphnilpotent-Jacobian methodrealizable Boolean matrix

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6179141
• Boolean matrix root computing and the relations between square roots of Boolean matrices and chromatic partitions of graphs
• scientific article; zbMATH DE number 1185595
• On complexity of realization of Boolean matrices with connected boundary
• scientific article; zbMATH DE number 4081452

Cited in

(5)

• scientific article; zbMATH DE number 3983193 (Why is no real title available?)
• Realizable Boolean matrices and counting symmetric transitive relations
• Boolean matrix root computing and the relations between square roots of Boolean matrices and chromatic partitions of graphs
• scientific article; zbMATH DE number 3891428 (Why is no real title available?)
• scientific article; zbMATH DE number 6179141 (Why is no real title available?)

This page was built for publication: Realizable problems of Boolean matrices and the relations between realizable Boolean matrices and chromatic number of graphs

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