scientific article; zbMATH DE number 4134090
From MaRDI portal
Publication:3035328
Recommendations
- scientific article; zbMATH DE number 68565
- On covering all cliques of a chordal graph
- scientific article; zbMATH DE number 29793
- Clique covering of graphs
- scientific article; zbMATH DE number 7310192
- Covering the cliques of a graph with vertices
- scientific article; zbMATH DE number 68359
- scientific article; zbMATH DE number 3762108
- scientific article; zbMATH DE number 975413
- On clique coverings of complete multipartite graphs
Cited in
(19)- The clique-separator graph for chordal graphs
- \(K_ i\)-covers. I: Complexity and polytopes
- The complexity of generalized clique covering
- Dominating cliques in chordal graphs
- Clique covering and clique partition in generalizations of line graphs
- Fast constructive and improvement heuristics for edge clique covering
- An overview of graph covering and partitioning
- Computing square roots of trivially perfect and threshold graphs
- Approximating the minimum clique cover and other hard problems in subtree filament graphs
- A generalization of chordal graphs and the maximum clique problem
- Clique Cover and Graph Separation
- Clique Covering of Graphs IV. Algorithms
- scientific article; zbMATH DE number 29793 (Why is no real title available?)
- scientific article; zbMATH DE number 68359 (Why is no real title available?)
- On the kernel size of clique cover reductions for random intersection graphs
- Constrained representations of map graphs and half-squares
- On the equivalence covering number of splitgraphs
- Edge clique partition and cover beyond independence
- Edge-clique covers of the tensor product
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 Q3035328)
