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
Total Dominating Sets in Maximal Outerplanar Graphs
Sign Up to like & getrecommendations! Published in 2017 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-017-1802-7
Abstract: In this note we present an alternative proof of the result by Dorfling et al. (Discrete Math 339(3):1180–1188, 2016) establishing that any maximal outerplanar graph of order $$n \ge 5$$n≥5 has a total dominating set of… read more here.
Keywords: maximal outerplanar; outerplanar; outerplanar graphs; total dominating ... See more keywords