dr inż. Anna Małafiejska
Contact
 anna.malafiejska@pg.edu.pl
Publication showcase

Interval incidence coloring of bipartite graphs
In this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...

Global defensive sets in graphs
In the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if  N [ X ] ∩ S  ≥  N [ X ] \ S  holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...

On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
In the paper, we show that the incidence chromatic number of a complete kpartite graph is at most ∆+2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to ∆+1 if and only if the smallest part has only one vertex.
seen 433 times