Efficient domination for classes of \(P_6\)-free graphs
From MaRDI portal
Publication:2030432
DOI10.1016/j.dam.2016.08.019zbMath1476.05151arXiv1503.00091OpenAlexW2592128111MaRDI QIDQ2030432
Andreas Brandstädt, Erik Friese, T. Karthick, Elaine M. Eschen
Publication date: 7 June 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.00091
polynomial-time algorithmchordal graphsefficient dominationhole-free graphs\(P_6\)-free graphs(house, hole, domino)-free graphs
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Structure of squares and efficient domination in graph classes ⋮ On efficient domination for some classes of \(H\)-free chordal graphs ⋮ On efficient domination for some classes of \(H\)-free chordal graphs
Cites Work
- 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
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs
- Generalized domination and efficient domination in graphs
- Solving the weighted efficient edge domination problem on bipartite permutation graphs
- Efficient edge domination problems in graphs
- Weighted efficient domination problem on some perfect graphs
- Efficient graph representations
- Perfect edge domination and efficient edge domination in graphs
- Weighted independent perfect domination on cocomparability graphs
- The weighted perfect domination problem and its variants
- Perfect codes in graphs
- Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time
- Efficient Edge Domination on Hole-Free Graphs in Polynomial Time
- Graph Classes: A Survey
- Independence and Efficient Domination on P6-free Graphs
- Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
- New Polynomial Case for Efficient Domination in P 6-free Graphs
- Hereditary Efficiently Dominatable Graphs
- Multiplying matrices faster than coppersmith-winograd
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient domination for classes of \(P_6\)-free graphs
