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

zbMATH Open1224.15059MaRDI QIDQ3071841FDOQ3071841

Authors: Yan Yang, Xueping Wang 

Publication date: 5 February 2011

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

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)

Cited In (5)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

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)