Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs

J.Mark Keil,Patrice Belleville

doi:10.1016/j.dam.2003.04.004

Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs

J.Mark Keil, Patrice Belleville

https://doi.org/10.1016/j.dam.2003.04.004

Copy DOI

Journal: Discrete Applied Mathematics	Publication Date: Nov 5, 2003
Citations: 10	License type: elsevier-specific: oa user license

Affiliation: University of Saskatchewan, University of British Columbia

#Complements Of Graphs #Total Domination + Show 5 more

Abstract
Full-Text PDF
Similar Papers

Abstract

We investigate the complexity of several domination problems on the complements of bounded tolerance graphs and the complements of trapezoid graphs. We describe an O(n 2 log 5 n) time and O( n 2) space algorithm to solve the domination problem on the complement of a bounded tolerance graph, given a square embedding of that graph. We also prove that domination, connected domination and total domination are all NP-complete on co-trapezoid graphs.

Full Text