WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 18, 2019
A Linear Algorithm for Connected Domination in Partial k-Trees
Author:
Abstract: In this paper we claim that the Corollary 2 in [V. Pinciu, Dominating sets for outerplanar graphs, WSEAS Transactions on Mathematics 1(3), 2004, pp. 55–58] is false. In particular, we present a linear-time algorithm for partial k-trees that solves the problem.