scientific article; zbMATH DE number 6179141

MaRDI QIDQ4926920zbMATH OpenFDO

Authors Feng Sun, Xueping Wang

Publication date 20 June 2013

zbMATH Keywords

algorithmclique covercontentrealizable Boolean matrixundirected graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean and Hadamard matrices (15B34)

Recommendations

• Clique covers of graphs and ranks of Boolean matrices
• Realizable problems of Boolean matrices and the relations between realizable Boolean matrices and chromatic number of graphs
• Clique numbers of graphs and irreducible exact \(m\)-covers of the integers
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• On complexity of realization of Boolean matrices with connected boundary
• On clique coverings of complete multipartite graphs
• scientific article; zbMATH DE number 617588
• scientific article; zbMATH DE number 1405679
• scientific article; zbMATH DE number 7310243
• scientific article; zbMATH DE number 1934396

Cited in

(3)

• Realizable problems of Boolean matrices and the relations between realizable Boolean matrices and chromatic number of graphs
• A note on the realizability problem of nonnegative integral symmetric matrices
• Clique covers of graphs and ranks of Boolean 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 Q4926920)