Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Characterizations of trees with equal paired and double domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of bipartite graphs related to chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling algorithms for domination problems in sun-free chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling algorithms for paired-domination problems in block and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for paired-domination problem in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired domination on interval and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for the paired-domination problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in convex and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in generalized claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs / 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: Perfect Elimination and Chordal Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3421937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs / 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
Property / cites work
 
Property / cites work: Paired-domination of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737226 / rank
 
Normal rank

Latest revision as of 04:09, 7 July 2024

scientific article
Language Label Description Also known as
English
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
scientific article

    Statements

    Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (English)
    0 references
    0 references
    0 references
    9 December 2013
    0 references
    0 references
    perfect matching
    0 references
    paired-domination
    0 references
    chordal bipartite graphs
    0 references
    perfect elimination bipartite graphs
    0 references
    NP-completeness
    0 references
    0 references