Satgraphs and independent domination. I
type: Item
instance of: scholarly article
title: Satgraphs and independent domination. I
zbMATH Open document ID: 1086.68048
published in: Theoretical Computer Science
publication date: 2006-03-24T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5015089
zbMATH Keywords: satgraphs
zbMATH Keywords: satisfiability problem
zbMATH Keywords: hereditary class of graphs
zbMATH Keywords: forbidden induced subgraph characterization
zbMATH Keywords: independent domination problem
zbMATH Keywords: polar graphs
zbMATH Keywords: perfect graphs
zbMATH Keywords: NP-complete
zbMATH Keywords: polynomial-time algorithm
author: I.È. Zverovich
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.08.038
OpenAlex ID: W2017593566
cites work: Dominating sets for split and bipartite graphs
cites work: About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
cites work: Progress on perfect graphs
cites work: Q3139761
cites work: The complexity of theorem-proving procedures
cites work: Q4193514
cites work: Q4198056
cites work: Geometric algorithms and combinatorial optimization.
cites work: Generalized split graphs and Ramsey numbers
cites work: Partitioning permutations into increasing and decreasing subsequences
cites work: Q3353058
cites work: Q4484907
cites work: Complexity results for well‐covered graphs
cites work: Q3743346
cites work: \(r\)-bounded \(k\)-complete bipartite bihypergraphs and generalized split graphs
cites work: Q4665545
DOI: 10.1016/J.TCS.2005.08.038
description: scientific article; zbMATH DE number 5015089