Distinguishing infinite graphs with bounded degrees (Q6081887)
From MaRDI portal
!
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 7746497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distinguishing infinite graphs with bounded degrees |
scientific article; zbMATH DE number 7746497 |
Statements
Distinguishing infinite graphs with bounded degrees (English)
0 references
5 October 2023
0 references
asymmetric colouring
0 references
distinguishing number
0 references
0 references
0.8910325169563293
0 references
0.8656401634216309
0 references
0.8351540565490723
0 references
0.8314396142959595
0 references
0.8112282156944275
0 references
