DIMACS TR: 2003-22

Independent domination on $2P_3$-free perfect graphs



Authors: I. E. Zverovich

ABSTRACT

We show that the independent domination problem is NP-complete for $2P_3$-free perfect graphs.

Keywords: Independent domination, perfect graph, NP-complete problem.

Paper Available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2003/2003-22.ps.gz

DIMACS Home Page