@inproceedings{583ea1074b3b4c4ebf549b452ae67af1,
title = "Domination search on graphs with low dominating-target-number",
abstract = "We settle two conjectures on domination-search, a game proposed by Fomin et.al. [1], one in affirmative and the other in negative. The two results presented here are (1) domination search number can be greater than domination-target number, (2) domination search number for asteroidal-triple-free graphs is at most 2.",
author = "Divesh Aggarwal and Mehta, {Shashank K.} and Deogun, {Jitender S.}",
year = "2005",
doi = "10.1007/11604686_3",
language = "English (US)",
isbn = "3540310002",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "28--37",
booktitle = "Graph-Theoretic Concepts in Computer Science - 31st International Workshop, WG 2005, Revised Selected Papers",
note = "31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2005 ; Conference date: 23-06-2005 Through 25-06-2005",
}