Odd and residue domination numbers of a graph

DOI10.7151/DMGT.1137zbMath0991.05080OpenAlexW2057939598MaRDI QIDQ2773048

Yair Caro, William F. Klostermeyer, John L. Goldwasser

Publication date: 24 March 2002

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/16d20af65cbf840f5ef764a1d7fe5c075c7d0c1d

zbMATH Keywords

parity dominationodd dominating set

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ On the complexity of dominating set problems related to the minimum all-ones problem

This page was built for publication: Odd and residue domination numbers of a graph