Domination in convex and chordal bipartite graphs (Q918703): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3797239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, independent domination, and duality in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs / rank
 
Normal rank

Revision as of 09:23, 21 June 2024

scientific article
Language Label Description Also known as
English
Domination in convex and chordal bipartite graphs
scientific article

    Statements

    Domination in convex and chordal bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    polynomial algorithm
    0 references
    NP-completeness
    0 references
    restricted classes of bipartite graphs
    0 references
    domination
    0 references

    Identifiers