A note on efficient domination in a superclass of \(P_5\)-free graphs

DOI10.1016/j.ipl.2014.02.007zbMath1285.05135OpenAlexW2025534681MaRDI QIDQ2446593

Andreas Brandstädt, Van Bang Le

Publication date: 17 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.02.007

zbMATH Keywords

combinatorial problemsperfect codeefficient dominationdomination in graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Weighted efficient domination in two subclasses of \(P_6\)-free graphs ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Solving the weighted efficient edge domination problem on bipartite permutation graphs
• New Polynomial Cases of the Weighted Efficient Domination Problem
• Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
• Hereditary Efficiently Dominatable Graphs
• Independent Set in P₅-Free Graphs in Polynomial Time
• A polynomial algorithm to find an independent set of maximum weight in a fork-free graph

This page was built for publication: A note on efficient domination in a superclass of \(P_5\)-free graphs