The Maximum Number of Dominating Induced Matchings-Reference-Cited by-同舟云学术

The Maximum Number of Dominating Induced Matchings

Published:2014-05-02 Issue:4 Volume:78 Page:258-268
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J. Graph Theory

Author:

Lin Min Chih¹,Moyano Veronica A.²,Rautenbach Dieter³,Szwarcfiter Jayme L.⁴

Affiliation:

1. CONICET, AND INSTITUTO DE CÁLCULO AND DEPARTAMENTO DE COMPUTACIÓN; UNIVERSIDAD DE BUENOS AIRES; BUENOS AIRES ARGENTINA

2. INSTITUTO DE CÁLCULO AND DEPARTAMENTO DE COMPUTACIÓN; UNIVERSIDAD DE BUENOS AIRES; BUENOS AIRES ARGENTINA

3. INSTITUT FÜR OPTIMIERUNG UND OPERATIONS RESEARCH; UNIVERSITÄT ULM; ULM GERMANY

4. INSTITUTO NACIONAL DE METROLOGIA, QUALIDADE E TECNOLOGIA; INSTITUTO DE MATEMÁTICA AND COPPE; UNIVERSIDADE FEDERAL DO RIO DE JANEIRO; RIO DE JANEIRO BRAZIL

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/jgt.21804/fullpdf

Reference12 articles.

1. Efficient edge domination on hole-free graphs in polynomial time;Brandstädt;Lect Notes Comput Sci,2010

2. Efficient dominating and edge dominating sets for graphs and hypergraphs;Brandstädt;Lect Notes Comput Sci,2012

3. Dominating induced matching for P7-free graphs in linear time;Brandstädt;Lect Notes Comput Sci,2011

4. Efficient edge domination in regular graphs;Cardoso;Discrete Appl Math,2008

5. On the complexity of the dominating induced matching problem in hereditary classes of graphs;Cardoso;Discrete Appl Math,2011

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dominating induced matching in some subclasses of bipartite graphs;Theoretical Computer Science;2021-09

2. On the dominating induced matching problem: Spectral results and sharp bounds;Discrete Applied Mathematics;2018-01

3. Perfect edge domination: hard and solvable cases;Annals of Operations Research;2017-10-06