More on the rainbow disconnection in graphs (Q2158198)
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 7562663
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More on the rainbow disconnection in graphs |
scientific article; zbMATH DE number 7562663 |
Statements
More on the rainbow disconnection in graphs (English)
0 references
26 July 2022
0 references
edge-coloring
0 references
edge-connectivity
0 references
rainbow disconnection coloring number
0 references
Erdős-Gallai type problem
0 references
Nordhaus-Gaddum type bounds
0 references
complexity
0 references
NP-hardness
0 references
0.894784688949585
0 references
0.8784335851669312
0 references
0.8764845132827759
0 references
0.8532133102416992
0 references
0.838759183883667
0 references
