Strong conflict-free connection of graphs (Q2284053)
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 7150637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong conflict-free connection of graphs |
scientific article; zbMATH DE number 7150637 |
Statements
Strong conflict-free connection of graphs (English)
0 references
14 January 2020
0 references
strong conflict-free connection coloring (number)
0 references
characterization
0 references
cubic graph
0 references
0 references
0.9366213083267212
0 references
0.8971341252326965
0 references
0.8728905320167542
0 references
0.871978759765625
0 references
0.8676037788391113
0 references
