Dominating induced matchings for P _7-free graphs in linear time
From MaRDI portal
Publication:3104604
dominating induced matchinglinear-time algorithmrobust algorithmefficient edge domination\(P _{7}\)-free graphs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- Dominating induced matching in some subclasses of bipartite graphs
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time
- Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time
- Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time
Cited in
(10)- Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
- Perfect edge domination: hard and solvable cases
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time
- The Maximum Number of Dominating Induced Matchings
- Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time
- Fast algorithms for some dominating induced matching problems
- Exact algorithms for minimum weighted dominating induced matching
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time
This page was built for publication: Dominating induced matchings for \(P _{7}\)-free graphs in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104604)
