Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs (Q5405924)
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: Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs |
scientific article; zbMATH DE number 6279069
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs |
scientific article; zbMATH DE number 6279069 |
Statements
Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs (English)
0 references
3 April 2014
0 references
independent domination
0 references
circular convex bipartite graph
0 references
triad convex bipartite graph
0 references
polynomial-time reduction
0 references
