Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs (Q5405924): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 01:48, 9 February 2024

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
    0 references
    0 references
    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

    Identifiers