Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 (Q898171)
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 6517706
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 |
scientific article; zbMATH DE number 6517706 |
Statements
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 (English)
0 references
8 December 2015
0 references
rainbow connection
0 references
edge coloring
0 references
forbidden subgraphs
0 references
0.944238543510437
0 references
0.8985685110092163
0 references
0.8794752955436707
0 references
0.8788989186286926
0 references
0.8710936307907104
0 references
