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

From MaRDI portal
Revision as of 23:51, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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