Complexity of Fall Coloring for Restricted Graph Classes
Sign Up to like & getrecommendations! Published in 2020 at "Theory of Computing Systems"
DOI: 10.1007/s00224-020-09982-9
Abstract: We strengthen a result by Laskar and Lyle (Discrete Appl. Math. 157, 330–338 2009) by proving that it is NP-complete to decide whether a bipartite planar graph can be partitioned into three independent dominating sets.… read more here.
Keywords: independent dominating; dominating sets; graph; fall coloring ... See more keywords