Hanna Furmańczyk

A note on mixed tree coloring

In this note we observe that the problem of mixed graph coloring can be solved in linear time for trees, which improves the quadratic algorithm of Hansen et al. [P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160].

Scheduling with precedence constraints: mixed graph coloring in series-parallel graphs

We consider the mixed graph coloring problem which is used for formulating scheduling problems where both incompatibility and precedence constraints can be present. We give an O(n3.376 log n) algorithm for finding an optimal schedule for a collection of jobs whose constraint relations form a mixed series-parallel graph.

Equitable coloring of corona products of cubic graphs is harder than ordinary coloring

A graph is equitably

Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines ☆

k

Altitude of wheels and wheel-like graphs

-colorable if its vertices can be partitioned into

Equitable colorings of corona multiproducts of graphs

k

Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs

independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest

Mixed graph edge coloring

k

The Complexity of Equitable Vertex Coloring of Graphs

for which such a coloring exists is known as the \emph{equitable chromatic number} of

Equitable coloring of graph products

G