Counting independent sets in a tolerance graph
type: Item
instance of: scholarly article
title: Counting independent sets in a tolerance graph
zbMATH Open document ID: 1304.05106
author: Min-Sheng Lin
author: Sheng-Huang Su
published in: Discrete Applied Mathematics
publication date: 2014-12-05T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6377052
zbMATH Keywords: tolerance graphs
zbMATH Keywords: independent sets
zbMATH Keywords: maximal independent sets
zbMATH Keywords: independent perfect dominating sets
zbMATH Keywords: counting problem
MaRDI profile type: Publication
full work available at URL: j.dam.2014.09.011
OpenAlex ID: W1985963532
cites work: Proper and unit tolerance graphs
cites work: Weighted independent perfect domination on cocomparability graphs
cites work: Q3797233
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Q4828541
cites work: Fast and simple algorithms to count the number of vertex covers in an interval graph
cites work: Counting the number of vertex covers in a trapezoid graph
cites work: Counting maximal independent sets in directed path graphs
cites work: A New Intersection Model and Improved Algorithms for Tolerance Graphs
cites work: Intersection graphs of paths in a tree
cites work: Counting the number of independent sets in chordal graphs
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: The Complexity of Enumeration and Reliability Problems
DOI: 10.1016/J.DAM.2014.09.011
description: scientific article; zbMATH DE number 6377052