8 citations · 18 across the 9 of their papers we have counts for
12 papers
Majority C-coloring of graphs
Csilla Bujtas, Magda Dettlaff, Hanna Furmanczyk +1
Inspired by the majority colorings and C-colorings, we introduce and study the majority C-coloring of graphs. In such a vertex coloring, every vertex shares its color with at least…
Packing coloring of graphs with long paths
Hanna Furmańczyk, Didem Gözüpek, Sibel Özkan
The packing coloring problem has diverse applications, including frequency assignment in wireless networks, resource distribution and facility location in smart cities and post-dis…
Scheduling on uniform and unrelated machines with bipartite incompatibility graphs
Tytus Pikies, Hanna Furmańczyk
In this paper the problem of scheduling of jobs on parallel machines under incompatibility relation is considered. In this model a binary relation between jobs is given and no two…
Equitable -degenerate choosability of graphs
E. Drgas-Burchardt, H. Furmańczyk, E. Sidorowicz
Let be the class of -degenerate graphs and let be a list assignment for a graph . A colouring of such that every vertex receives a colour from its li…
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…
Equitable total coloring of corona of cubic graphs
Hanna Furmańczyk, Rita Zuazua
The minimum number of total independent partition sets of of a graph is called the \emph{total chromatic number} of , denoted by . If the difference…
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…