The bottleneck independent domination on the classes of bipartite graphs and block graphs. (Q1429835)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The bottleneck independent domination on the classes of bipartite graphs and block graphs. |
scientific article; zbMATH DE number 2066780
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bottleneck independent domination on the classes of bipartite graphs and block graphs. |
scientific article; zbMATH DE number 2066780 |
Statements
The bottleneck independent domination on the classes of bipartite graphs and block graphs. (English)
0 references
27 May 2004
0 references
Bottleneck cost
0 references
Independent dominating set
0 references
NP-hard
0 references
Chordal-bipartite graph
0 references
Convex-bipartite graph
0 references
Tree
0 references
Block graph
0 references
