On conflict-free connection of graphs (Q1727736)
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 7027134
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On conflict-free connection of graphs |
scientific article; zbMATH DE number 7027134 |
Statements
On conflict-free connection of graphs (English)
0 references
20 February 2019
0 references
edge-coloring
0 references
connectivity
0 references
conflict-free connection number
0 references
Nordhaus-Gaddum-type result
0 references
0 references
0 references
0.91015362739563
0 references
0.9088608026504515
0 references
0.9030113220214844
0 references
0.8902037143707275
0 references
0.8889882564544678
0 references
