Counting dominating sets in some subclasses of bipartite graphs

DOI10.1016/J.TCS.2022.05.021OpenAlexW4281635937MaRDI QIDQ2672635

Min-Sheng Lin

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.05.021

zbMATH Keywords

bipartite graphscounting problemdominating setstree convex bipartite graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
• Feedback vertex sets on restricted bipartite graphs
• Counting independent sets and maximal independent sets in some subclasses of bipartite graphs
• Independent Domination on Tree Convex Bipartite Graphs
• Two Hardness Results on Feedback Vertex Sets
• Dominating Set Counting in Graph Classes
• The Complexity of Enumeration and Reliability Problems
• The Complexity of Planar Counting Problems
• Fast and simple algorithms for counting dominating sets in distance-hereditary graphs
• Counting dominating sets in generalized series-parallel graphs

This page was built for publication: Counting dominating sets in some subclasses of bipartite graphs