Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time
From MaRDI portal
Publication:6201338
DOI10.1016/j.tcs.2024.114404OpenAlexW3102493589WikidataQ129687791 ScholiaQ129687791MaRDI QIDQ6201338
Raffaele Mosca, Andreas Brandstädt
Publication date: 20 February 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114404
polynomial time algorithmdominating induced matchingefficient edge domination\( P_{10}\)-free graphs
Cites Work
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time
- On the complexity of the dominating induced matching problem in hereditary classes of graphs
- Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time
- Solving the weighted efficient edge domination problem on bipartite permutation graphs
- Efficient edge domination problems in graphs
- Perfect edge domination and efficient edge domination in graphs
- Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time
- Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs
- Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time
- Dominating induced matchings in graphs without a skew star
- Perfect codes in graphs
- A characterization of graphs without long induced paths
- Efficient Edge Domination on Hole-Free Graphs in Polynomial Time
- Dominating induced matchings in graphs containing no long claw
- Dominating induced matching in some subclasses of bipartite graphs
This page was built for publication: Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time
