Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
From MaRDI portal
Publication:1801055
DOI10.1016/j.dam.2018.05.012zbMath1398.05148OpenAlexW2806833391MaRDI QIDQ1801055
Andreas Brandstädt, Martin Milanič, Vassilis Giakoumakis
Publication date: 26 October 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.05.012
polynomial-time algorithmmodular decomposition\(H\)-free graphslinear forestweighted efficient domination\((H_1, H_2)\)-free graphs
Related Items (4)
Efficient domination in Cayley graphs of generalized dihedral groups ⋮ Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs ⋮ On efficient domination for some classes of \(H\)-free chordal graphs ⋮ On efficient domination for some classes of \(H\)-free bipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- On the complexity of the dominating induced matching problem in hereditary classes of graphs
- Algorithms for unipolar and generalized split graphs
- Classifying the clique-width of \(H\)-free bipartite graphs
- On diameters and radii of bridged graphs
- Generalized domination and efficient domination in graphs
- Solving the weighted efficient edge domination problem on bipartite permutation graphs
- Modular decomposition and transitive orientation
- Efficient edge domination problems in graphs
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- Weighted efficient domination problem on some perfect graphs
- Weighted domination of cocomparability graphs
- Perfect edge domination and efficient edge domination in graphs
- Weighted independent perfect domination on cocomparability graphs
- The weighted perfect domination problem and its variants
- Linear time solvable optimization problems on graphs of bounded clique-width
- A note on efficient domination in a superclass of \(P_5\)-free graphs
- Perfect codes in graphs
- New Polynomial Cases of the Weighted Efficient Domination Problem
- Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs
- Dominating Induced Matchings for P 7-free Graphs in Linear Time
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- Efficient Edge Domination on Hole-Free Graphs in Polynomial Time
- A Simple Linear Time LexBFS Cograph Recognition Algorithm
- A Linear Recognition Algorithm for Cographs
- On graphs with polynomially solvable maximum-weight clique problem
- A New Algorithm for Generating All the Maximal Independent Sets
- 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 GRAPH WITH FEW P4'S
- Hereditary Efficiently Dominatable Graphs
- Bounding the Clique‐Width of H‐Free Chordal Graphs
- On efficient domination for some classes of \(H\)-free chordal graphs
This page was built for publication: Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
