NP-completeness results for partitioning a graph into total dominating sets
From MaRDI portal
Publication:5920155
DOI10.1007/978-3-319-62389-4_28zbMath1433.68158OpenAlexW2886376538MaRDI QIDQ5920155
Mikko Koivisto, Petteri Laakkonen, Juho Lauri
Publication date: 23 October 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10138/307255
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Coupon-coloring and total domination in Hamiltonian planar triangulations ⋮ Role colouring graphs in hereditary classes ⋮ NP-completeness results for partitioning a graph into total dominating sets
