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
Independent bondage number of a graph
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-018-0319-1
Abstract: A vertex set S of a simple finite graph $$G=(V;E)$$G=(V;E) is said to be an independent set if there is no edge between any pair of vertices of S and a dominating set if for… read more here.
Keywords: bondage number; dominating set; independent bondage; independent dominating ... See more keywords