Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Connected odd dominating sets in graphs

From MaRDI portal
Publication:5492638
Jump to:navigation, search

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


zbMATH Keywords

dominating set


Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5492638&oldid=30046568"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 March 2024, at 03:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki