@article{dmtcs:2107,
    title      = {Maximum difference about the size of optimal identifying codes in graphs differing by one vertex},
    author     = {Mikko Pelto},
    url        = {https://dmtcs.episciences.org/2107},
    doi        = {10.46298/dmtcs.2107},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {Vol. 17 no. 1},
    issuetitle = {Graph Theory},
    eid        = 1,
    year       = {2015},
    month      = {May},
    keywords   = {identifying codes, graph theory, twin-free graphs, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC]},
    language   = {English},
}