A linear kernel for planar total dominating set

zbMATH Open1401.05218arXiv1211.0978MaRDI QIDQ4560237FDOQ4560237

Authors: Valentin Garnero, Ignasi Sau 

Publication date: 10 December 2018

Full work available at URL: https://arxiv.org/abs/1211.0978

Recommendations

• Linear-time computation of a linear problem kernel for dominating set on planar graphs
• Simpler linear-time kernelization for planar dominating set
• A linear kernel for a planar connected dominating set
• Linear Kernel for Planar Connected Dominating Set
• A linear kernel for planar red-blue dominating set

zbMATH Keywords

parameterized complexityplanar graphstotal dominationlinear kernels

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (5)

• Linear Kernel for Planar Connected Dominating Set
• Kernelization and Sparseness: the case of Dominating Set
• On some domination colorings of graphs
• A linear kernel for planar red-blue dominating set
• Linear-time computation of a linear problem kernel for dominating set on planar graphs

This page was built for publication: A linear kernel for planar total dominating set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560237)