AbstractLet Gn be a graph of n vertices, having chromatic number r which contains no complete graph of r vertices. Then Gn contains a vertex of degree not exceeding n(3r−7)/(3r−4). The result is essentially best possible
AbstractWe give an upper bound on the chromatic number of a graph in terms of its maximum degree and...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
AbstractA graph G is (m,k)-colourable if its vertices can be coloured with m colours such that the m...
AbstractLet Gn be a graph of n vertices, having chromatic number r which contains no complete graph ...
Let Gn be a graph of n vertices, having chromatic number r which contains no complete graph of r ver...
The clique chromatic number of a graph is the minimum number of colours needed to colour its vertice...
Let Gr(n) be an r-chromatic graph with n vertices in each colour class. Suppose G = G3(n), and δ(G),...
We prove that (Formula presented.), where (Formula presented.) is the Ramsey parameter introduced by...
We prove that (Formula presented.), where (Formula presented.) is the Ramsey parameter introduced by...
AbstractA lower bound is obtained for the chromatic number X(G) of a graph G in terms of its vertex ...
AbstractA lower bound is obtained for the chromatic number X(G) of a graph G in terms of its vertex ...
If G is a simple graph with minimum degree (G) satisfying (G) f(|V(G|+1) the total chromatic number ...
summary:In this paper, we show that the maximal number of minimal colourings of a graph with $n$ ver...
Let G be a graph and let s be the maximum number of vertices of the same degree, each at least (∆(G)...
AbstractThe problem of covering the vertex set of a graph with subsets spanning subgraphs of smaller...
AbstractWe give an upper bound on the chromatic number of a graph in terms of its maximum degree and...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
AbstractA graph G is (m,k)-colourable if its vertices can be coloured with m colours such that the m...
AbstractLet Gn be a graph of n vertices, having chromatic number r which contains no complete graph ...
Let Gn be a graph of n vertices, having chromatic number r which contains no complete graph of r ver...
The clique chromatic number of a graph is the minimum number of colours needed to colour its vertice...
Let Gr(n) be an r-chromatic graph with n vertices in each colour class. Suppose G = G3(n), and δ(G),...
We prove that (Formula presented.), where (Formula presented.) is the Ramsey parameter introduced by...
We prove that (Formula presented.), where (Formula presented.) is the Ramsey parameter introduced by...
AbstractA lower bound is obtained for the chromatic number X(G) of a graph G in terms of its vertex ...
AbstractA lower bound is obtained for the chromatic number X(G) of a graph G in terms of its vertex ...
If G is a simple graph with minimum degree (G) satisfying (G) f(|V(G|+1) the total chromatic number ...
summary:In this paper, we show that the maximal number of minimal colourings of a graph with $n$ ver...
Let G be a graph and let s be the maximum number of vertices of the same degree, each at least (∆(G)...
AbstractThe problem of covering the vertex set of a graph with subsets spanning subgraphs of smaller...
AbstractWe give an upper bound on the chromatic number of a graph in terms of its maximum degree and...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
AbstractA graph G is (m,k)-colourable if its vertices can be coloured with m colours such that the m...
DOI
Add to ORKG