NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs
type: Item
instance of: scholarly article
title: NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs
zbMATH Open document ID: 1491.68080
author: Yaroslav Anatol'Evich Loverov
author: Yury L. Orlovich
published in: Diskretnyi analiz i issledovanie operatsii
publication date: 2022-07-15T00:00:00Z
full work available at URL: da951
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7558115
zbMATH Keywords: independent dominating set
zbMATH Keywords: cubic graph
zbMATH Keywords: planar graph
zbMATH Keywords: bipartite graph
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
OpenAlex ID: W4244661030
cites work: Q3291034
cites work: Q4060985
cites work: Q3895508
cites work: Total domination in graphs
cites work: Graph-theoretic parameters concerning domination, independence, and irredundance
cites work: Q4894998
cites work: The neighbourhood number of a graph
cites work: Q5688099
cites work: Q4368729
cites work: Q4368728
cites work: Connected dominating set. Theory and applications
cites work: Independent domination in graphs: A survey and recent results
cites work: Total Domination in Graphs
cites work: Independent dominating set problem revisited
cites work: Q5668821
cites work: Q4847233
cites work: Q4198056
cites work: On the algorithmic complexity of twelve covering and independence parameters of graphs
cites work: Q3127081
DOI: 10.33048/DAIO.2020.27.657
description: scientific article; zbMATH DE number 7558115