On optimal exact coverings of a graph in the class of weakly dense bases

DOI10.1515/1569392041938776MaRDI QIDQ3409840zbMATH OpenOpenAlexFDO

Authors Z. S. Lozhkina

Publication date 20 November 2006

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/1569392041938776

zbMATH Keywords

algorithmscomplexityasymptotic behaviourShannon function\((0,1)\)-matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On weakly dense bases in a class of graphs
• scientific article; zbMATH DE number 975337
• scientific article; zbMATH DE number 1818147
• scientific article; zbMATH DE number 2032373
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices

Cites work

• scientific article; zbMATH DE number 1818147 (Why is no real title available?)
• scientific article; zbMATH DE number 46669 (Why is no real title available?)
• scientific article; zbMATH DE number 2032373 (Why is no real title available?)
• On weakly dense bases in a class of graphs

Cited in

(3)

• On weakly dense bases in a class of graphs
• scientific article; zbMATH DE number 1818147 (Why is no real title available?)
• scientific article; zbMATH DE number 2032373 (Why is no real title available?)

This page was built for publication: On optimal exact coverings of a graph in the class of weakly dense bases

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