Identifying codes in bipartite graphs of given maximum degree (Q6885239)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 8135838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identifying codes in bipartite graphs of given maximum degree |
scientific article; zbMATH DE number 8135838 |
Statements
Identifying codes in bipartite graphs of given maximum degree (English)
0 references
11 December 2025
0 references
identifying codes
0 references
maximum degree
0 references
trees
0 references
bipartite graphs
0 references
