1 citations · 1 across the 10 of their papers we have counts for
12 papers · 1 filter
Majority C-coloring in Cartesian products
Csilla Bujtás, Magda Dettlaff, Hanna Furmańczyk +1
A majority C-coloring of a graph assigns colors to the vertices such that every vertex shares its color with at least half of its neighbors. The maximum number of colors that c…
Isolation subdivision number of a graph
Magda Dettlaff, Magdalena Lemańska, Merce Mora +2
For a graph a set is called an isolating set of if the set is independent. The minimum cardinality of an isolating set in is the isolati…
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…
Isolation critical graphs under multiple edge subdivision
Karl Bartolo, Peter Borg, Magda Dettlaff +2
This paper introduces the notion of an -critical graph. The isolation number of a graph , denoted by and also known as the vertex-edge domination number of , is…
A new approach to b-coloring of regular graphs
Magda Dettlaff, Hanna Furmańczyk, Iztok Peterin +2
Let be a graph and c a proper k-coloring of G, i.e. any two adjacent vertices u and v have different colors c(u) and c(v). A proper k-coloring is a b-coloring if there exists a…
Characterization of -excellent -trees
Magda Dettlaff, Michael A. Henning, Jerzy Topp
A graph is -excellent if every vertex of the graph is contained in some maximum independent set of the graph. In this paper, we present two characterizations of the -excellen…