Some results on dominating induced matchings

DOI10.1007/s00373-022-02470-6zbMath1485.05125arXiv1912.00511OpenAlexW2990716390MaRDI QIDQ2117540

Yanyan Li

Publication date: 21 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.00511

zbMATH Keywords

induced matchingdominating induced matchingKneser graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Dominating induced matchings for \(P_7\)-free graphs in linear time
• On the complexity of the dominating induced matching problem in hereditary classes of graphs
• Efficient edge domination in regular graphs
• Induced matchings
• Efficient edge domination problems in graphs
• On the dominating induced matching problem: spectral results and sharp bounds
• Dominating induced matchings in graphs containing no long claw

This page was built for publication: Some results on dominating induced matchings