Dominating induced matchings in graphs without a skew star (Q2447537): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Treewidth for graphs with small chordality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating induced matchings for \(P_7\)-free graphs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Edge Domination on Hole-Free Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Induced Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient edge domination in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the dominating induced matching problem in hereditary classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. V. Global structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence and upper irredundance in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient edge domination problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular codes in regular graphs are difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable cutsets in claw-free graphs and planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the weighted efficient edge domination problem on bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect edge domination and efficient edge domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank

Latest revision as of 11:30, 8 July 2024

scientific article
Language Label Description Also known as
English
Dominating induced matchings in graphs without a skew star
scientific article

    Statements

    Dominating induced matchings in graphs without a skew star (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2014
    0 references
    dominating induced matching
    0 references
    efficient edge dominating set
    0 references
    polynomial-time algorithm
    0 references
    clique-width
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references