Discrete Mathematics & Theoretical Computer Science (Mar 2014)

Graphs where every k-subset of vertices is an identifying set

Sylvain Gravier,
Svante Janson,
Tero Laihonen,
Sanna Ranto

Affiliations

Sylvain Gravier: ORCiD; Laboratoire Leibniz
Svante Janson: Department of Mathematics [Uppsala]
Tero Laihonen: ORCiD; Coding Theory Research Group
Sanna Ranto: ORCiD; Department of Physics and Astronomy [Turku]

DOI: https://doi.org/10.46298/dmtcs.1253
Journal volume & issue: Vol. Vol. 16 no. 1, no. Combinatorics

Abstract

Combinatorics

[math.math-co] mathematics [math]/combinatorics [math.co]

Published in Discrete Mathematics & Theoretical Computer Science

ISSN: 1462-7264 (Print); 1365-8050 (Online)
Publisher: Discrete Mathematics & Theoretical Computer Science
Country of publisher: France
LCC subjects: Science: Mathematics
Website: https://dmtcs.episciences.org/

About the journal