8 citations · 18 across the 6 of their papers we have counts for
8 papers
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines
Tytus Pikies, Krzysztof Turowski, Marek Kubale
In this paper we consider the problem of scheduling on parallel machines with a presence of incompatibilities between jobs. The incompatibility relation can be modeled as a complet…
Equitable Colorings of -Corona Products of Cubic Graphs
Hanna Furmańczyk, Marek Kubale
A graph is equitably -colorable if its vertices can be partitioned into independent sets in such a way that the number of vertices in any two sets differ by at most one.…
Tight Bounds on the Complexity of Semi-Equitable Coloring of Cubic and Subcubic Graphs
H. Furmańczyk, M. Kubale
A -coloring of a graph is called semi-equitable if there exists a partition of its vertex set into independent subsets in such a way that $|V_1| \noti…
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
H. Furmanczyk, M. Kubale
In the paper we consider the problem of scheduling identical jobs on 4 uniform machines with speeds respectively. Our aim is to find a schedul…
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
H. Furmańczyk, M. Kubale
In the paper we consider the problem of scheduling identical jobs on 3 uniform machines with speeds and to minimize the schedule length. We assume that jobs a…
Equitable coloring of corona products of cubic graphs is harder than ordinary coloring
Hanna Furmańczyk, Marek Kubale
A graph is equitably -colorable if its vertices can be partitioned into independent sets in such a way that the number of vertices in any two sets differ by at most one. The…
On bipartization of cubic graphs by removal of an independent set
Hanna Furmańczyk, Marek Kubale, Stanisław Radziszowski
We study a new problem for cubic graphs: bipartization of a cubic graph by deleting sufficiently large independent set . It can be expressed as follows: \emph{Given a connec…
Equitable Colorings of Corona Multiproducts of Graphs
Hanna Furmañczyk, Marek Kubale, Vahan V. Mkrtchyan
A graph is equitably -colorable if its vertices can be partitioned into independent sets in such a way that the number of vertices in any two sets differ by at most one. The…