Efficient edge domination in regular graphs
From MaRDI portal
Publication:1005253
DOI10.1016/J.DAM.2008.01.021zbMATH Open1210.05094OpenAlexW2103621629MaRDI QIDQ1005253FDOQ1005253
Authors: C. Delorme, Pedro C. Silva, D. M. Cardoso, Jorge Orestes Cerdeira 
Publication date: 9 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.01.021
Recommendations
- Efficient edge domination problems in graphs
- Perfect edge domination and efficient edge domination in graphs
- Efficient dominating and edge dominating sets for graphs and hypergraphs
- scientific article; zbMATH DE number 4085682
- Efficient domination and efficient edge domination: a brief survey
- Edge domination in graphs
- Efficient domination in circulant graphs
- Efficient total domination in digraphs
- Efficient edge domination on hole-free graphs in polynomial time
- scientific article; zbMATH DE number 1151809
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of Graph Theory
- Induced matchings
- 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
- NP-completeness of some generalizations of the maximum matching problem
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
- Title not available (Why is that?)
- On the approximability of the maximum induced matching problem
- New results on induced matchings
- Induced matchings in intersection graphs.
- Regular codes in regular graphs are difficult
- Title not available (Why is that?)
- Biclique decompositions and Hermitian rank
Cited In (17)
- Title not available (Why is that?)
- Combinatorial and spectral properties of König-Egerváry graphs
- Independent feedback vertex set for \(P_5\)-free graphs
- Some results on dominating induced matchings
- Perfect edge domination: hard and solvable cases
- Bounding and approximating minimum maximal matchings in regular graphs
- Dominating induced matchings in graphs without a skew star
- Efficient domination through eigenvalues
- On the complexity of the dominating induced matching problem in hereditary classes of graphs
- The Maximum Number of Dominating Induced Matchings
- Modelling and solving the perfect edge domination problem
- Dominating induced matchings
- On the dominating induced matching problem: spectral results and sharp bounds
- Graphs whose vertices of degree at least 2 lie in a triangle
- Exact algorithms for dominating induced matching based on graph partition
- Exact algorithms for minimum weighted dominating induced matching
- Complexity of simplicial homology and independence complexes of chordal graphs
This page was built for publication: Efficient edge domination in regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1005253)
