Geodesic
Graphs where every k-subset of vertices is an identifying set
Discrete mathematics & theoretical computer science, Tome 16 (2014) no. 1.

Voir la notice de l'article provenant de la source Episciences

Combinatorics 
@article{DMTCS_2014_16_1_a9,
     author = {Gravier, Sylvain and Janson, Svante and Laihonen, Tero and Ranto, Sanna},
     title = {Graphs where every k-subset of vertices is an identifying set},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {16},
     number = {1},
     year = {2014},
     doi = {10.46298/dmtcs.1253},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1253/}
}
TY  - JOUR
AU  - Gravier, Sylvain
AU  - Janson, Svante
AU  - Laihonen, Tero
AU  - Ranto, Sanna
TI  - Graphs where every k-subset of vertices is an identifying set
JO  - Discrete mathematics & theoretical computer science
PY  - 2014
VL  - 16
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1253/
DO  - 10.46298/dmtcs.1253
LA  - en
ID  - DMTCS_2014_16_1_a9
ER  - 
%0 Journal Article
%A Gravier, Sylvain
%A Janson, Svante
%A Laihonen, Tero
%A Ranto, Sanna
%T Graphs where every k-subset of vertices is an identifying set
%J Discrete mathematics & theoretical computer science
%D 2014
%V 16
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1253/
%R 10.46298/dmtcs.1253
%G en
%F DMTCS_2014_16_1_a9
Gravier, Sylvain; Janson, Svante; Laihonen, Tero; Ranto, Sanna. Graphs where every k-subset of vertices is an identifying set. Discrete mathematics & theoretical computer science, Tome 16 (2014) no. 1. doi : 10.46298/dmtcs.1253. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1253/

Cité par Sources :