AbstractWe give examples of vertex-transitive graphs with non-monotonic chromatic difference sequences, disproving a conjecture of Albertson and Collins (1985) on the monotonicity of the chromatic difference sequence of vertex-transitive graphs, and answering a question of Zhou (1991) on the achievability of circulants
The graphs on which dihedral, quaternion, and abelian groups act vertex and/or edge transitivity are...
AbstractWe provide an example of a 5-chromatic oriented graph D such that the categorical product of...
AbstractLet αk(G) denote the maximum number of vertices in a k-colorable subgraph of G. Set αk=αk(G)...
AbstractThe chromatic difference sequence cds(G) of a graph G with chromatic number n is defined by ...
AbstractThis paper examines the effect of a graph homomorphism upon the chromatic difference sequenc...
AbstractThis note characterizes graphs with the second term of their chromatic difference sequences ...
AbstractThis paper is a continuation of our earlier paper under the same title. We prove that the no...
AbstractFor graphs G and H, the Cartesian product G × H is defined as follows: the vertex set is V(G...
AbstractLet αk(G) denote the maximum number of vertices in a k-colorable subgraph of G. Set αk(G)=αk...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
It is shown that the difference between the chromatic number χ and the fractional chromatic number χ...
For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1,...
We provide an example of a 5-chromatic oriented graph D such that the categorical product of D and T...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
The graphs on which dihedral, quaternion, and abelian groups act vertex and/or edge transitivity are...
AbstractWe provide an example of a 5-chromatic oriented graph D such that the categorical product of...
AbstractLet αk(G) denote the maximum number of vertices in a k-colorable subgraph of G. Set αk=αk(G)...
AbstractThe chromatic difference sequence cds(G) of a graph G with chromatic number n is defined by ...
AbstractThis paper examines the effect of a graph homomorphism upon the chromatic difference sequenc...
AbstractThis note characterizes graphs with the second term of their chromatic difference sequences ...
AbstractThis paper is a continuation of our earlier paper under the same title. We prove that the no...
AbstractFor graphs G and H, the Cartesian product G × H is defined as follows: the vertex set is V(G...
AbstractLet αk(G) denote the maximum number of vertices in a k-colorable subgraph of G. Set αk(G)=αk...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
It is shown that the difference between the chromatic number χ and the fractional chromatic number χ...
For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1,...
We provide an example of a 5-chromatic oriented graph D such that the categorical product of D and T...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
The graphs on which dihedral, quaternion, and abelian groups act vertex and/or edge transitivity are...
AbstractWe provide an example of a 5-chromatic oriented graph D such that the categorical product of...
AbstractLet αk(G) denote the maximum number of vertices in a k-colorable subgraph of G. Set αk=αk(G)...
DOI
Add to ORKG