On the number of optimal identifying codes in a twin-free graph - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2015

On the number of optimal identifying codes in a twin-free graph

, (1, 2) , (1, 2)
1
2
Not file

Dates and versions

hal-02286996 , version 1 (13-09-2019)

Identifiers

  • HAL Id : hal-02286996 , version 1

Cite

I. Honkala, Olivier Hudry, Antoine Lobstein. On the number of optimal identifying codes in a twin-free graph. Discrete Applied Mathematics, 2015, 180, pp.111-119. ⟨hal-02286996⟩
26 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More