Conflict-free connections of graphs (Q1656907)
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: Conflict-free connections of graphs |
scientific article; zbMATH DE number 6916578
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Conflict-free connections of graphs |
scientific article; zbMATH DE number 6916578 |
Statements
Conflict-free connections of graphs (English)
0 references
10 August 2018
0 references
edge-coloring
0 references
conflict-free connection
0 references
2-edge-connected graph
0 references
tree
0 references
0 references
0.97568107
0 references
0.96443737
0 references
0.94327366
0 references
0 references
0.9208703
0 references
0.91851306
0 references
0.9108046
0 references
0 references
