Distance-constrained labellings of Cartesian products of graphs (Q2231783)
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 7404886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distance-constrained labellings of Cartesian products of graphs |
scientific article; zbMATH DE number 7404886 |
Statements
Distance-constrained labellings of Cartesian products of graphs (English)
0 references
30 September 2021
0 references
channel assignment
0 references
frequency assignment
0 references
distance-constrained labelling
0 references
chromatic number
0 references
Cartesian product of graphs
0 references
Hamming graph
0 references
graph power
0 references
0.8814754486083984
0 references
0.8789831399917603
0 references
0.8724623918533325
0 references
0.8315356969833374
0 references
0.8296292424201965
0 references
