Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping from V (G) to V (H), that is (x)(y) is an arc in H whenever xy is an arc in G. The orie...
Abstract. We answer two questions of Zhu on circular choosability of graphs. We show that the circular list chromatic number of an even cycle is equal to 2 and give an example of a...
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...