scientific article; zbMATH DE number 1463390

zbMATH Open0968.05060MaRDI QIDQ4487449FDOQ4487449

Authors: Chris B. Smart, Peter Slater 

Publication date: 21 June 2000

Title of this publication is not available (Why is that?)

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

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)

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Constructing Minimal Coverability Sets
• Assignment-minimum clique coverings
• Approximating the minimum tour cover of a digraph
• Linear programming formulation for some generalized domination parameters
• Balanced minimum covers of a finite set
• Title not available (Why is that?)
• On the minimum vertex covering transversal dominating sets in graphs and their classification
• Minimal cut cover of a graph with an application to the testing of electronic boards

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)