Pages that link to "Item:Q3944641"
From MaRDI portal
The following pages link to On the covering of the vertices of a graph by cliques (Q3944641):
Displaying 26 items.
- A simple lower bound on edge coverings by cliques (Q807634) (← links)
- Dyck's map \(\{3,7\}_ 8\) is a counterexample to a clique covering conjecture (Q920116) (← links)
- Maximum set of edges no two covered by a clique (Q1084407) (← links)
- Clique covering of graphs (Q1100482) (← links)
- Covering all cliques of a graph (Q1174130) (← links)
- Covering the cliques of a graph with vertices (Q1201260) (← links)
- Clique covering and clique partition in generalizations of line graphs (Q1343162) (← links)
- Irreducible coverings by cliques and Sperner's theorem (Q1856342) (← links)
- Covering the edges of a random graph by cliques (Q1906846) (← links)
- A simple proof of the Gan-Loh-Sudakov conjecture (Q2088706) (← links)
- On the triangle clique cover and \(K_t\) clique cover problems (Q2279271) (← links)
- Clique coverings of the edges of a random graph (Q2367438) (← links)
- (Q3011753) (← links)
- (Q3035328) (← links)
- (Q3136983) (← links)
- Clique Covering of Graphs IV. Algorithms (Q3340897) (← links)
- (Q4014314) (← links)
- (Q4014421) (← links)
- (Q4242950) (← links)
- Multiple vertex coverings by specified induced subgraphs (Q4489493) (← links)
- Another note on cliques and independent sets (Q4521486) (← links)
- Topological cliques in graphs II (Q4883063) (← links)
- Disproof of a packing conjecture of Alon and Spencer (Q4973635) (← links)
- An upper bound on the number of cliques in a graph (Q5287454) (← links)
- Vertex covers by edge disjoint cliques (Q5955194) (← links)
- The Number of Cliques in Graphs Covered by Long Cycles (Q6098464) (← links)
