@article{dmtcs:3843,
    title      = {Exact values for three domination-like problems in circular and infinite grid graphs of small height},
    author     = {Marwane Bouznif and Julien Darlay and Julien Moncel and Myriam Preissmann},
    url        = {https://dmtcs.episciences.org/3843},
    doi        = {10.23638/DMTCS-21-3-12},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {Vol. 21 no. 3},
    issuetitle = {Graph Theory},
    eid        = 12,
    year       = {2019},
    month      = {May},
    keywords   = {grid, graph algorithm, identifying code, locating-dominating code, locating-total-dominating code, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.1: Graph labeling, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.4: Path and circuit problems, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]},
    language   = {English},
}