DOIAbstract
AbstractConsider a graph G with the property that any set of p vertices in G contains a q-clique. Fairly tight lower bounds are proved on the clique number of G as a function of p, q and the number of vertices in G
AbstractConsider a graph G with the property that any set of p vertices in G contains a q-clique. Fairly tight lower bounds are proved on the clique number of G as a function of p, q and the number of vertices in G
Let G be a graph of order n and clique number!: For every x = (x1; : : : ; xn) 2 Rn and 1 s !; set ...
AbstractTurán's theorem (Mat. Fiz. Lapok 48 (1941) 436) (or rather its extension by Zykov (Mat. Sbor...
AbstractA clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a c...
AbstractConsider a graph G with the property that any set of p vertices in G contains a q-clique. Fa...
This paper proposes three new analytical lower bounds on the clique number of a graph and compares t...
A k−clique covering of a simple graph G, is an edge covering of G by its cliques such that each vert...
AbstractFor each natural number n, denote by G(n) the set of all numbers c such that there exists a ...
AbstractA graph G is clique-critical if G and G−x have different clique-graphs for all vertices x of...
A set S of vertices in a graph G is a global dominating set of G if S simultaneously dominates both ...
This project is for students interested in applying algebra and computa-tion to an important problem...
AbstractWe prove that a locally cobipartite graph on n vertices contains a family of at most n cliqu...
AbstractLet ƒ(n, p, q) be the maximum possible number of q-cliques among all graphs on n nodes with ...
AbstractFor a graph G, a subgraph C is called a clique of G if C is a complete subgraph of G maximal...
The clique chromatic number of a graph is the minimum number of colours needed to colour its vertice...
AbstractWe obtain a sequence k1(G) ≤ k2(G) ≤ … ≤ kn(G) of lower bounds for the clique number (size o...
Let G be a graph of order n and clique number!: For every x = (x1; : : : ; xn) 2 Rn and 1 s !; set ...
AbstractTurán's theorem (Mat. Fiz. Lapok 48 (1941) 436) (or rather its extension by Zykov (Mat. Sbor...
AbstractA clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a c...
AbstractConsider a graph G with the property that any set of p vertices in G contains a q-clique. Fa...
This paper proposes three new analytical lower bounds on the clique number of a graph and compares t...
A k−clique covering of a simple graph G, is an edge covering of G by its cliques such that each vert...
AbstractFor each natural number n, denote by G(n) the set of all numbers c such that there exists a ...
AbstractA graph G is clique-critical if G and G−x have different clique-graphs for all vertices x of...
A set S of vertices in a graph G is a global dominating set of G if S simultaneously dominates both ...
This project is for students interested in applying algebra and computa-tion to an important problem...
AbstractWe prove that a locally cobipartite graph on n vertices contains a family of at most n cliqu...
AbstractLet ƒ(n, p, q) be the maximum possible number of q-cliques among all graphs on n nodes with ...
AbstractFor a graph G, a subgraph C is called a clique of G if C is a complete subgraph of G maximal...
The clique chromatic number of a graph is the minimum number of colours needed to colour its vertice...
AbstractWe obtain a sequence k1(G) ≤ k2(G) ≤ … ≤ kn(G) of lower bounds for the clique number (size o...
Let G be a graph of order n and clique number!: For every x = (x1; : : : ; xn) 2 Rn and 1 s !; set ...
AbstractTurán's theorem (Mat. Fiz. Lapok 48 (1941) 436) (or rather its extension by Zykov (Mat. Sbor...
AbstractA clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a c...
Add to ORKG