Perfect edge domination: hard and solvable cases (Q1639290): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2618104112 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1705.08379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs / 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 in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Characterization of $$P_k$$-free 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: Q5284002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient edge domination problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating induced matchings in graphs containing no long claw / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching / 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: Fast algorithms for some dominating induced matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and perfect domination on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Number of Dominating Induced Matchings / 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: Exact algorithms for dominating induced matching based on graph partition / rank
 
Normal rank

Latest revision as of 22:21, 15 July 2024

scientific article
Language Label Description Also known as
English
Perfect edge domination: hard and solvable cases
scientific article

    Statements

    Perfect edge domination: hard and solvable cases (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 June 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    claw-free graphs
    0 references
    complexity dichotomy
    0 references
    cubic graphs
    0 references
    NP-completeness
    0 references
    perfect edge domination
    0 references
    0 references
    0 references