scientific article; zbMATH DE number 1156657

MaRDI QIDQ4390693zbMATH OpenFDO

Authors Chris B. Smart, Peter Slater

Publication date 14 September 1998

zbMATH Keywords

closed neighborhood order dominationdominationlinear programmingNP-complete

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05)

Cited in

(17)

• Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
• Efficient domination for classes of \(P_6\)-free graphs
• Efficient closed domination in digraph products
• A note on efficient domination in a superclass of \(P_5\)-free graphs
• Structure of squares and efficient domination in graph classes
• scientific article; zbMATH DE number 1191209 (Why is no real title available?)
• scientific article; zbMATH DE number 637524 (Why is no real title available?)
• scientific article; zbMATH DE number 759647 (Why is no real title available?)
• Graphs that are simultaneously efficient open domination and efficient closed domination graphs
• Hereditary efficiently dominatable graphs
• On efficient domination for some classes of \(H\)-free chordal graphs
• On efficient domination for some classes of \(H\)-free chordal graphs
• Weighted efficient domination for P₈-free bipartite graphs in polynomial time
• A study on the weighted efficient domination problem for C₄-free bipartite graphs
• New characterization of efficient closed and open dominated graphs
• Algorithms for unipolar and generalized split graphs
• Weighted efficient domination in two subclasses of P₆-free graphs

This page was built for publication:

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