Efficient Edge Domination on Hole-Free Graphs in Polynomial Time-Reference-Cited by-同舟云学术

Efficient Edge Domination on Hole-Free Graphs in Polynomial Time

Published:2010 Issue: Volume: Page:650-661
ISSN:0302-9743
Container-title:LATIN 2010: Theoretical Informatics
language:
Short-container-title:

Author:

Brandstädt Andreas,Hundt Christian,Nevries Ragnar

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-12200-2_56.pdf

Reference15 articles.

1. Bange, D., Barkauskas, A., Slater, P.: Efficient near-domination of graphs. Congr. Numer. 58, 83–92 (1987)

2. Bange, D., Barkauskas, A., Slater, P.: Efficient domination sets in graphs. In: Ringeisen, R.D., Roberts, F.S. (eds.) Applications of Discrete Mathematics, pp. 189–199. SIAM, Philadelphia (1988)

3. Biggs, N.: Perfect codes in graphs. J. Combin. Theory Ser. B 15, 289–296 (1973)

4. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1–23 (1993)

5. SIAM Monographs on Discrete Math. Appl.;A. Brandstädt,1999

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

1. Dominating induced matchings and other graph parameters;AKCE International Journal of Graphs and Combinatorics;2024-06-27

2. Finding dominating induced matchings in P10-free graphs in polynomial time;Theoretical Computer Science;2024-04

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

4. Finding dominating induced matchings in S1,1,5-free graphs in polynomial time;Discrete Applied Mathematics;2020-09

5. Finding dominating induced matchings in S2,2,3-free graphs in polynomial time;Discrete Applied Mathematics;2020-09