scientific article; zbMATH DE number 1420902

MaRDI QIDQ4944971zbMATHFDO

Authors Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle

Publication date 7 June 2000

zbMATH Keywords

independencealgorithmdigraphdominationset existence problem

Mathematics Subject Classification ID

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

Recommendations

• Mod-2 independence and domination in graphs
• Independence and domination in divisor graph and mod-difference graphs
• Independence and 2-domination in bipartite graphs
• Independent \((1, 2)\)-domination in graphs
• Independence and \(k\)-domination in graphs
• On domination and independence numbers of graphs
• On 2-domination and independence domination numbers of graphs.
• scientific article; zbMATH DE number 1161346
• scientific article; zbMATH DE number 734465
• scientific article; zbMATH DE number 795022

Cited in

(5)

• On a modular domination game.
• Combinatorial properties of a general domination problem with parity constraints
• Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
• On the complexity of dominating set problems related to the minimum all-ones problem
• Mod-2 independence and domination in 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 Q4944971)