Connected odd dominating sets in graphs
From MaRDI portal
Publication:5492638
DOI10.7151/dmgt.1276zbMath1103.05058OpenAlexW2006504240MaRDI QIDQ5492638
Raphael Yuster, Yair Caro, William F. Klostermeyer
Publication date: 16 October 2006
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.6659
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (5)
Unnamed Item ⋮ A note on Lights-Out-puzzle: parity-state graphs ⋮ On the complexity of dominating set problems related to the minimum all-ones problem ⋮ On the complexity of finding large odd induced subgraphs and odd colorings ⋮ A Survey of the Game “Lights Out!”
This page was built for publication: Connected odd dominating sets in graphs