On efficient domination for some classes of \(H\)-free chordal graphs
From MaRDI portal
Publication:5920175
DOI10.1016/j.endm.2017.10.011zbMath1383.05229OpenAlexW2585379412MaRDI QIDQ5920175
Raffaele Mosca, Andreas Brandstädt
Publication date: 9 April 2018
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2017.10.011
Related Items (2)
Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs ⋮ On efficient domination for some classes of \(H\)-free chordal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- Algorithms for unipolar and generalized split graphs
- Generalized domination and efficient domination in graphs
- The weighted perfect domination problem and its variants
- Linear time solvable optimization problems on graphs of bounded clique-width
- Efficient domination for classes of \(P_6\)-free graphs
- Perfect codes in graphs
- New Polynomial Cases of the Weighted Efficient Domination Problem
- Bounding the Clique-Width of H-free Chordal Graphs
- Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs
- Independence and Efficient Domination on P6-free Graphs
- Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
- Reducibility among Combinatorial Problems
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- Hereditary Efficiently Dominatable Graphs
- On efficient domination for some classes of \(H\)-free chordal graphs
This page was built for publication: On efficient domination for some classes of \(H\)-free chordal graphs
