On the size of identifying codes in triangle-free graphs (Q427898)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the size of identifying codes in triangle-free graphs |
scientific article; zbMATH DE number 6047056
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the size of identifying codes in triangle-free graphs |
scientific article; zbMATH DE number 6047056 |
Statements
On the size of identifying codes in triangle-free graphs (English)
0 references
18 June 2012
0 references
identifying code
0 references
dominating set
0 references
triangle-free graph
0 references
maximum degree
0 references
0 references
0 references
