scientific article; zbMATH DE number 1286502
From MaRDI portal
Publication:4242950
Recommendations
- Clique covering of graphs
- scientific article; zbMATH DE number 68359
- Covering the cliques of a graph with vertices
- Clique cover on sparse networks
- Covering all cliques of a graph
- Bounded clique cover of some sparse graphs
- scientific article; zbMATH DE number 3762108
- Biclique cover and local clique cover of graphs
- Multiple vertex coverings by cliques
- On biclique coverings
Cited in
(12)- Covering complete \(r\)-graphs with spanning complete \(r\)-partite \(r\)-graphs
- scientific article; zbMATH DE number 1545697 (Why is no real title available?)
- A bound on the total size of a cut cover
- On the variance of average distance of subsets in the Hamming space
- On the biclique cover of the complete graph
- Optimal partial clique edge covering guided by potential energy minimization
- Clique covers of \(H\)-free graphs
- Average distance and minimum average distance of binary constant weight code and its properties
- Covering complete hypergraphs with cuts of minimum total size
- On the minimum average distance of binary codes: Linear programming approach
- On the minimum average distance of binary constant weight codes
- scientific article; zbMATH DE number 790476 (Why is no real title available?)
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 Q4242950)
