Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs (Q6287029)
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: Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs |
scientific article; zbMATH DE number 900316388
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs |
scientific article; zbMATH DE number 900316388 |
Statements
23 May 2017
0 references
math.CO
0 references
