NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs (Q5090153): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:48, 8 February 2024
scientific article; zbMATH DE number 7558115
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs |
scientific article; zbMATH DE number 7558115 |
Statements
NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs (English)
0 references
15 July 2022
0 references
independent dominating set
0 references
cubic graph
0 references
planar graph
0 references
bipartite graph
0 references
NP-completeness
0 references
