Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
type: Item
instance of: scholarly article
title: Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
zbMATH Open document ID: 1043.05090
author: J. Mark Keil
author: Patrice Belleville
published in: Discrete Applied Mathematics
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 2083770
zbMATH Keywords: Dominating set
zbMATH Keywords: Comparability graph
zbMATH Keywords: Bounded tolerance graph
zbMATH Keywords: Trapezoid graph
MaRDI profile type: Publication
full work available at URL: j.dam.2003.04.004
OpenAlex ID: W2084877920
cites work: Q3875975
cites work: On testing isomorphism of permutation graphs
cites work: Permutation graphs: Connected domination and Steiner trees
cites work: Q3797233
cites work: Clustering and domination in perfect graphs
cites work: Dominating sets in perfect graphs
cites work: Trapezoid graphs and their coloring
cites work: Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
cites work: Tolerance graphs, and orders
cites work: Trapezoid graphs and generalizations, geometry and algorithms
cites work: Q4198056
cites work: Q3328583
cites work: Q3322150
cites work: Tolerance graphs
cites work: Some Efficient Algorithms for Permutation Graphs
cites work: On Finding the Maxima of a Set of Vectors
cites work: Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
cites work: Fast algorithms for the dominating set problem on permutation graphs
cites work: New Data Structures for Orthogonal Range Queries
DOI: 10.1016/J.DAM.2003.04.004
description: scientific article; zbMATH DE number 2083770