Dominating Induced Matchings (Q3655141): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Domingos Moreira Cardoso / rank
Normal rank
 
Property / author
 
Property / author: Vadim V. Lozin / rank
Normal rank
 
Property / author
 
Property / author: Domingos Moreira Cardoso / rank
 
Normal rank
Property / author
 
Property / author: Vadim V. Lozin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-02029-2_8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1486102037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The induced matching and chain subgraph cover problems for convex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings / 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: Efficient edge domination in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient edge domination problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size / 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 maximum induced matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5487903 / 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: Solving the weighted efficient edge domination problem on bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S / rank
 
Normal rank

Latest revision as of 08:51, 2 July 2024

scientific article
Language Label Description Also known as
English
Dominating Induced Matchings
scientific article

    Statements

    Dominating Induced Matchings (English)
    0 references
    7 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dominating induced matching
    0 references
    efficient edge dominating set
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references