This paper presents a historical review and recent developments in mixed graph colorings in
the light of scheduling problems with the makespan criterion. A mixed graph contains both a …

Abstract An (m, n)-colored mixed graph is a mixed graph with arcs assigned one of m
different colors and edges one of n different colors. A homomorphism of an (m, n)-colored …

Oriented colourings of graphs with maximum degree three and four - ScienceDirect Skip to
main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

While intersection graphs play a central role in the algorithmic analysis of hard problems on
undirected graphs, the role of intersection digraphs in algorithms is much less understood …

An oriented graph is a directed graph with no directed cycle of length one or two. The
relative clique number of an oriented graph is the cardinality of a largest subset X of vertices …

Pushable homomorphisms and the pushable chromatic number χ p of oriented graphs were
introduced by Klostermeyer and MacGillivray in 2004. They notably observed that, for any …

We extend results of Brewster and Graves for switching $ m $-edge coloured graphs with
respect to a cyclic group to switching $(m, n) $-mixed graphs with respect to an Abelian …

An oriented graph is a directed graph without any directed cycle of length at most 2. An
oriented clique is an oriented graph whose non-adjacent vertices are connected by a …

In 1975, Plesník characterized all triangle-free planar graphs as having a diameter 2. We
characterize all triangle-free projective-planar graphs having a diameter 2 and discuss some …

Abstract An (n, m)-graph is characterized by n types of arcs and m types of edges. A
homomorphism of an (n, m)-graph G to an (n, m)-graph H, is a vertex mapping that …