Conflict-free connections of graphs (Q1656907): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:36, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Conflict-free connections of graphs |
scientific article |
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
