scientific article; zbMATH DE number 1463390

MaRDI QIDQ4487449zbMATH OpenFDO

Authors Chris B. Smart, Peter Slater

Publication date 21 June 2000

zbMATH Keywords

linear programmingdomination numbercomplexity problems\(Y\)-domination-coverage number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Domination cover number of graphs
• Characterization of graphs with equal domination and covering number
• Dominating sets for split and bipartite graphs
• Algorithmic aspects of \(\mathcal{F}\)-domination in graphs

Cited in

(10)

• Linear programming formulation for some generalized domination parameters
• Balanced minimum covers of a finite set
• Approximating the minimum tour cover of a digraph
• Constructing Minimal Coverability Sets
• scientific article; zbMATH DE number 1843998 (Why is no real title available?)
• scientific article; zbMATH DE number 817208 (Why is no real title available?)
• scientific article; zbMATH DE number 15860 (Why is no real title available?)
• Minimal cut cover of a graph with an application to the testing of electronic boards
• Assignment-minimum clique coverings
• On the minimum vertex covering transversal dominating sets in graphs and their classification

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 Q4487449)