Minimal identifying codes in trees and planar graphs with large girth (Q976158)
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: Minimal identifying codes in trees and planar graphs with large girth |
scientific article; zbMATH DE number 5722044
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal identifying codes in trees and planar graphs with large girth |
scientific article; zbMATH DE number 5722044 |
Statements
Minimal identifying codes in trees and planar graphs with large girth (English)
0 references
17 June 2010
0 references
finite undirected graph
0 references
0 references
0.9351037740707396
0 references
0.8750778436660767
0 references
0.8436579704284668
0 references
0.8325836658477783
0 references
