8 citations · 18 across the 9 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…