Mod-2 independence and domination in graphs

DOI10.1142/S0129054100000272MaRDI QIDQ5249044zbMATH OpenOpenAlexFDO

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

Publication date 29 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054100000272

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 1420902
• Partitioning vertices into in- and out-dominating sets in digraphs
• Independent domination in directed graphs
• The algorithmic complexity of domination digraphs
• Independent edges in bipartite graphs obtained from orientations of graphs

Cites work

• Linear cellular automata and the garden-of-eden
• On the complexity of some coding problems (Corresp.)
• The intractability of computing the minimum distance of a code

Cited in

(6)

• Parameterized complexity of generalized domination problems
• scientific article; zbMATH DE number 1420902 (Why is no real title available?)
• On weak odd domination and graph-based quantum secret sharing
• On the complexity of finding large odd induced subgraphs and odd colorings
• Residue domination in bounded-treewidth graphs
• Sort and Search: exact algorithms for generalized domination

This page was built for publication: Mod-2 independence and domination in graphs

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