Counting independent sets in tree convex bipartite graphs
type: Item
instance of: scholarly article
title: Counting independent sets in tree convex bipartite graphs
zbMATH Open document ID: 1352.05146
author: Min-Sheng Lin
author: Chien-Min Chen
published in: Discrete Applied Mathematics
publication date: 2016-12-28T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6668741
zbMATH Keywords: tree convex bipartite 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.2016.08.017
OpenAlex ID: W2558138609
cites work: The weighted perfect domination problem and its variants
cites work: Maximum matching in a convex bipartite graph
cites work: The Complexity of Planar Counting Problems
cites work: Two Hardness Results on Feedback Vertex Sets
cites work: Feedback vertex sets on restricted bipartite graphs
cites work: Fast and simple algorithms to count the number of vertex covers in an interval graph
cites work: Counting independent sets in a tolerance graph
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: Independent Domination on Tree Convex Bipartite Graphs
cites work: The complexity of counting in sparse, regular, and planar graphs
cites work: The Complexity of Enumeration and Reliability Problems
DOI: 10.1016/J.DAM.2016.08.017
description: scientific article; zbMATH DE number 6668741