8 citations · 14 across the 6 of their papers we have counts for
6 papers
Adjacent Vertex Distinguishing Total Coloring of Corona Product of Graphs
Hanna Furmańczyk, Rita Zuazua
An adjacent vertex distinguishing total -coloring of a graph is a proper total -coloring of such that no pair of adjacent vertices has the same color sets, where…
Approximation algorithms for job scheduling with block-type conflict graphs
Hanna Furmańczyk, Tytus Pikies, Inka Sokołowska +1
The problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality crite…
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
Hanna Furmańczyk, Vahan Mkrtchyan
An equitable coloring of a graph is a (proper) vertex-coloring of , such that the sizes of any two color classes differ by at most one. In this paper, we consider the…
Vizing-Goldberg type bounds for the equitable chromatic number of block graphs
Janusz Dybizbański, Hanna Furmańczyk, Vahan Mkrtchyan
An equitable coloring of a graph is a proper vertex coloring of such that the sizes of any two color classes differ by at most one. In the paper, we pose a conjecture that…
Equitable List Vertex Colourability and Arboricity of Grids
Ewa Drgas-Burchardt, Janusz Dybizbański, Hanna Furmańczyk +1
A graph is equitably -list arborable if for any -uniform list assignment , there is an equitable -colouring of whose each colour class induces an acyclic graph.…
On Star Coloring of Splitting Graphs
Hanna Furmańczyk, Kowsalya V, Vernold Vivin J
In this paper, we consider the problem of a star coloring. In general case the problems in NP-complete. We establish the star chromatic number for splitting graph of complete and c…