Strong conflict-free connection of graphs (Q2284053): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:34, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong conflict-free connection of graphs |
scientific article |
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
