AbstractAlthough the chromatic number of a graph is not known in general, attempts have been made to find good bounds for the number. Here we prove that a K1,3-free and a {(K2 ∪ K1) + K2}-free graph has chromatic number at most equal to its maximum clique size plus one
AbstractWe give an upper bound on the chromatic number of a graph in terms of its maximum degree and...
Given a simple graph G = (V, E), a subset U of V is called a clique if it induces a complete subgrap...
The Colouring problem is that of deciding, given a graph G and an integer k, whether G admits a (pro...
AbstractAlthough the chromatic number of a graph is not known in general, attempts have been made to...
AbstractThe relation of chromatic aspects and the existence of certain induced subgraphs of a triang...
A colouring of a graph G = (V;E) is a mapping c : V ! f1; 2; : : :g such that c(u) 6= c(v) if uv 2 E...
AbstractIn this paper we obtain some upper bounds for the b-chromatic number of K1,s-free graphs, gr...
A colouring of a graph G = (V;E) is a mapping c : V ! f1; 2; : : :g such that c(u) 6= c(v) if uv 2 ...
AbstractBrooks' Theorem says that if for a graph G,Δ(G)=n, then G is n-colourable, unless (1) n=2 an...
Given a simple graph G = (V, E), a subset U of V is called a clique if it induces a complete subgrap...
AbstractGrünbaum's conjecture on the existence of k-chromatic graphs of degree k and girth g for eve...
A colouring of a graph G=(V,E) is a mapping c:V→{1,2,…} such that c(u)≠c(v) if uv∈E; if |c(V)|⩽k the...
Given two graphs H1 and H2, a graph G is (H1,H2)-free if it contains no subgraph isomorphic to H1 or...
AbstractIt is shown that there are two positive constants c1,c2 such that the maximum possible chrom...
AbstractWe consider the subchromatic number χS(G) of graph G, which is the minimum order of all part...
AbstractWe give an upper bound on the chromatic number of a graph in terms of its maximum degree and...
Given a simple graph G = (V, E), a subset U of V is called a clique if it induces a complete subgrap...
The Colouring problem is that of deciding, given a graph G and an integer k, whether G admits a (pro...
AbstractAlthough the chromatic number of a graph is not known in general, attempts have been made to...
AbstractThe relation of chromatic aspects and the existence of certain induced subgraphs of a triang...
A colouring of a graph G = (V;E) is a mapping c : V ! f1; 2; : : :g such that c(u) 6= c(v) if uv 2 E...
AbstractIn this paper we obtain some upper bounds for the b-chromatic number of K1,s-free graphs, gr...
A colouring of a graph G = (V;E) is a mapping c : V ! f1; 2; : : :g such that c(u) 6= c(v) if uv 2 ...
AbstractBrooks' Theorem says that if for a graph G,Δ(G)=n, then G is n-colourable, unless (1) n=2 an...
Given a simple graph G = (V, E), a subset U of V is called a clique if it induces a complete subgrap...
AbstractGrünbaum's conjecture on the existence of k-chromatic graphs of degree k and girth g for eve...
A colouring of a graph G=(V,E) is a mapping c:V→{1,2,…} such that c(u)≠c(v) if uv∈E; if |c(V)|⩽k the...
Given two graphs H1 and H2, a graph G is (H1,H2)-free if it contains no subgraph isomorphic to H1 or...
AbstractIt is shown that there are two positive constants c1,c2 such that the maximum possible chrom...
AbstractWe consider the subchromatic number χS(G) of graph G, which is the minimum order of all part...
AbstractWe give an upper bound on the chromatic number of a graph in terms of its maximum degree and...
Given a simple graph G = (V, E), a subset U of V is called a clique if it induces a complete subgrap...
The Colouring problem is that of deciding, given a graph G and an integer k, whether G admits a (pro...
DOI
Add to ORKG