Minimal identifying codes in trees and planar graphs with large girth (Q976158): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejc.2009.11.012 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1965065197 / rank | |||
Revision as of 03:00, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimal identifying codes in trees and planar graphs with large girth |
scientific article |
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
