This project involved pulling together past work on the achromatic and first-fit chromatic numbers, as well as a description of a proof by Yegnanarayanan et al. Our work includes attempting to find patterns for them in specific classes of graphs and the beginnings of an attempt to prove that for any given a, b, c, such that 2 \u3c= a \u3c= b \u3c= c, there exists a graph with chromatic number a, first-fit chromatic number b, and achromatic number c
The pseudoachromatic number of a graph is the largest number of colours in a (not necessarily proper...
AbstractWe determine families of circulant graphs for which each graph G=Gc(n;S) has chromatic numbe...
In this talk we give the notion of complete colorings in graphs, achromatic number, Knesser graphs a...
The harmonious chromatic number of a graph is the least number of colours in a vertex colouring such...
Abstract: The achromatic number χa (G) of a graph is the greatest number of color in a vertex colori...
[[abstract]]The first-fit chromatic number of a graph is the number of colors needed in the worst ca...
International audienceThe chromatic number, which refers to the minimum number of colours required t...
AbstractThe first-fit chromatic number of a graph is the number of colors needed in the worst case o...
The achromatic number problem is to legally color the vertices of an input graph with the maximum nu...
The achromatic number of a graph is the greatest number of colors in a coloring of the vertices of t...
A complete colouring of a simple graph G is a proper vertex colouring such that each pair of colours...
AbstractThe achromatic number ψ(G) of a graph G = (V, E) is the maximum k such that V has a partitio...
Let G be a simple graph. The achromatic number ?(G) is the largest number of colors possible in a pr...
The achromatic number Ã(G) of a graph G = (V;E) is the maximum k such that V has a partition V1; V2;...
Copyright © 2013 P. Shanas Babu, A. V. Chithra. This is an open access article distributed under the...
The pseudoachromatic number of a graph is the largest number of colours in a (not necessarily proper...
AbstractWe determine families of circulant graphs for which each graph G=Gc(n;S) has chromatic numbe...
In this talk we give the notion of complete colorings in graphs, achromatic number, Knesser graphs a...
The harmonious chromatic number of a graph is the least number of colours in a vertex colouring such...
Abstract: The achromatic number χa (G) of a graph is the greatest number of color in a vertex colori...
[[abstract]]The first-fit chromatic number of a graph is the number of colors needed in the worst ca...
International audienceThe chromatic number, which refers to the minimum number of colours required t...
AbstractThe first-fit chromatic number of a graph is the number of colors needed in the worst case o...
The achromatic number problem is to legally color the vertices of an input graph with the maximum nu...
The achromatic number of a graph is the greatest number of colors in a coloring of the vertices of t...
A complete colouring of a simple graph G is a proper vertex colouring such that each pair of colours...
AbstractThe achromatic number ψ(G) of a graph G = (V, E) is the maximum k such that V has a partitio...
Let G be a simple graph. The achromatic number ?(G) is the largest number of colors possible in a pr...
The achromatic number Ã(G) of a graph G = (V;E) is the maximum k such that V has a partition V1; V2;...
Copyright © 2013 P. Shanas Babu, A. V. Chithra. This is an open access article distributed under the...
The pseudoachromatic number of a graph is the largest number of colours in a (not necessarily proper...
AbstractWe determine families of circulant graphs for which each graph G=Gc(n;S) has chromatic numbe...
In this talk we give the notion of complete colorings in graphs, achromatic number, Knesser graphs a...