scientific article; zbMATH DE number 1286502
From MaRDI portal
Publication:4242950
DOI10.1002/(SICI)1097-0118(199804)27:4%3C223::AID-JGT3%3E3.0.CO;2-PzbMATH Open0919.05050MaRDI QIDQ4242950FDOQ4242950
Authors: André Kündgen 
Publication date: 11 May 1999
Title of this publication is not available (Why is that?)
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
- Title not available (Why is that?)
- 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
- On the minimum average distance of binary codes: Linear programming approach
- Covering complete hypergraphs with cuts of minimum total size
- On the minimum average distance of binary constant weight codes
- Title not available (Why is that?)
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)
