(1, 2)-rainbow connection number at most 3 in connected dense graphs (Q6090318)
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: (1, 2)-rainbow connection number at most 3 in connected dense graphs |
scientific article; zbMATH DE number 7779638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | (1, 2)-rainbow connection number at most 3 in connected dense graphs |
scientific article; zbMATH DE number 7779638 |
Statements
(1, 2)-rainbow connection number at most 3 in connected dense graphs (English)
0 references
16 December 2023
0 references
edge-colouring
0 references
rainbow connection
0 references
\((1, 2)\)-rainbow connection
0 references
0.9116112
0 references
0.9073969
0 references
0.9072647
0 references
0.9065763
0 references
0.9009141
0 references
0.89704967
0 references
0.89694774
0 references
0.89643586
0 references
0.8941314
0 references
