scientific article; zbMATH DE number 3762108
From MaRDI portal
Publication:3944641
zbMATH Open0485.05052MaRDI QIDQ3944641FDOQ3944641
Publication date: 1982
Title of this publication is not available (Why is that?)
Recommendations
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (22)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering the edges of a random graph by cliques
- Title not available (Why is that?)
- Title not available (Why is that?)
- Clique covering and clique partition in generalizations of line graphs
- How many graphs are unions of k‐cliques?
- The Number of Cliques in Graphs Covered by Long Cycles
- Multiple vertex coverings by specified induced subgraphs
- On the triangle clique cover and \(K_t\) clique cover problems
- Another note on cliques and independent sets
- Title not available (Why is that?)
- Irreducible coverings by cliques and Sperner's theorem
- Vertex covers by edge disjoint cliques
- Dyck's map \(\{3,7\}_ 8\) is a counterexample to a clique covering conjecture
- Title not available (Why is that?)
- Covering the cliques of a graph with vertices
- Title not available (Why is that?)
- Maximum set of edges no two covered by a clique
- Clique Covering of Graphs IV. Algorithms
- Clique covering of graphs
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 Q3944641)
