Clique covering of graphs
From MaRDI portal
The clique covering number cc(G) of a graph G is the least number of complete subgraphs of G necessary to cover the edge set of G. The author shows that there exists an integer \(n_ 0\) such that for all graphs G on \(n>n_ 0\) vertices \(\max \{cc(G)+cc(\bar G)\}=\lfloor n^ 2/4\rfloor +2.\) This settles a conjecture of Erdős.
Recommendations
Cites work
Cited in
(60)- Clique numbers of graphs
- Maximum set of edges no two covered by a clique
- Clique partitions and clique coverings
- Covering all cliques of a graph
- Covering the cliques of a graph with vertices
- Clique covering and clique partition in generalizations of line graphs
- On the number of edges not covered by monochromatic copies of a fixed graph.
- Graphs satisfying inequality (G^2) (G)
- Edge clique covering sum of graphs
- Edges not in any monochromatic copy of a fixed graph
- Extremal clique coverings of complementary graphs
- Clique covers and coloring problems of graphs
- Irreducible coverings by cliques and Sperner's theorem
- Regarding two conjectures on clique and biclique partitions
- Clique coverings and claw-free graphs
- On clique coverings of complete multipartite graphs
- Bounded clique cover of some sparse graphs
- Clique coverings and partitions of line graphs
- Sphericity, cubicity, and edge clique covers of graphs
- Weak clique-covering cycles and paths.
- The asymptotic order of the abdiff-tolerance edge clique cover number of \(K_{2,n}\)
- Bounds for the clique cover width of factors of the apex graph of the planar grid
- Clique Cover and Graph Separation
- On the largest reduced neighborhood clique cover number of a graph
- A new upper bound for the clique cover number with applications
- scientific article; zbMATH DE number 4134090 (Why is no real title available?)
- Clique coverings of glued graphs at complete clones
- scientific article; zbMATH DE number 3843787 (Why is no real title available?)
- Clique Covering of Graphs IV. Algorithms
- Local clique covering of claw-free graphs
- scientific article; zbMATH DE number 3914355 (Why is no real title available?)
- scientific article; zbMATH DE number 3926961 (Why is no real title available?)
- scientific article; zbMATH DE number 4039954 (Why is no real title available?)
- scientific article; zbMATH DE number 4065029 (Why is no real title available?)
- scientific article; zbMATH DE number 3758388 (Why is no real title available?)
- scientific article; zbMATH DE number 3762108 (Why is no real title available?)
- scientific article; zbMATH DE number 68359 (Why is no real title available?)
- scientific article; zbMATH DE number 109202 (Why is no real title available?)
- scientific article; zbMATH DE number 1286502 (Why is no real title available?)
- scientific article; zbMATH DE number 637364 (Why is no real title available?)
- scientific article; zbMATH DE number 1545697 (Why is no real title available?)
- Edge clique cover of claw-free graphs
- Largest reduced neighborhood clique cover number revisited
- scientific article; zbMATH DE number 800297 (Why is no real title available?)
- scientific article; zbMATH DE number 841571 (Why is no real title available?)
- On edges not in monochromatic copies of a fixed bipartite graph
- scientific article; zbMATH DE number 7310192 (Why is no real title available?)
- Edge-clique covers of the tensor product
- Assignment-minimum clique coverings
- A property about minimum edge- and minimum clique-cover of a graph
- Edge clique covers in graphs with independence number two
- Edges Not Covered by Monochromatic Bipartite Graph
- The Number of Cliques in Graphs Covered by Long Cycles
- How many cliques can a clique cover cover?
- Clique covers of \(H\)-free graphs
- Chromatic Ramsey numbers and two-color Turán densities
- Upper bounds on the edge clique cover number of a graph
- A simple lower bound on edge coverings by cliques
- Edge-clique covers of the tensor product
- Dyck's map \(\{3,7\}_ 8\) is a counterexample to a clique covering conjecture
This page was built for publication: Clique covering of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1100482)
