Tractable connected domination for restricted bipartite graphs (Q2354310)

From MaRDI portal
Revision as of 12:46, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Tractable connected domination for restricted bipartite graphs
scientific article

    Statements

    Tractable connected domination for restricted bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    10 July 2015
    0 references
    0 references
    connected domination
    0 references
    polynomial-time
    0 references
    circular-convex bipartite graph
    0 references
    triad-convex bipartite graph
    0 references
    convex bipartite graph
    0 references
    0 references