8 citations · 18 across the 6 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DM2014
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…
cs.DM2014★ 2 cited
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…