scientific article; zbMATH DE number 1463390

zbMATH Open0968.05060MaRDI QIDQ4487449

Chris B. Smart, Peter J. Slater

Publication date: 21 June 2000

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

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)

Related Items (8)

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

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)