A note on efficient domination in a superclass of P₅-free graphs

DOI10.1016/J.IPL.2014.02.007MaRDI QIDQ2446593zbMATH OpenOpenAlexFDO

Authors 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 problemsdomination in graphsefficient dominationperfect code

Mathematics Subject Classification ID

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

Recommendations

• Domination problems on \(P_{5}\)-free graphs
• Dominating cliques in \(P_ 5\)-free graphs
• Weighted efficient domination for P₅-free and P₆-free graphs
• Paired-domination in \(P_{5}\)-free graphs
• On a Class of P ₅ -Free Graphs
• scientific article; zbMATH DE number 1933051
• Weighted efficient domination for P₆-free and for P₅-free graphs
• Efficient domination for classes of \(P_6\)-free graphs
• A note on total domination in 5-regular graphs
• Classification of efficient dominating sets of circulant graphs of degree 5

Cites work

• A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
• Efficient dominating and edge dominating sets for graphs and hypergraphs
• Hereditary efficiently dominatable graphs
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1156657 (Why is no real title available?)
• Independent set in P₅-free graphs in polynomial time
• New polynomial cases of the weighted efficient domination problem
• Solving the weighted efficient edge domination problem on bipartite permutation graphs

Cited in

(4)

• Efficient absorbants in generalized de Bruijn digraphs
• Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
• On efficient absorbant conjecture in generalized de Bruijn digraphs
• Weighted efficient domination in two subclasses of P₆-free graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446593)