On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 (Q482191)
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 6381946
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 |
scientific article; zbMATH DE number 6381946 |
Statements
On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 (English)
0 references
19 December 2014
0 references
rainbow connection
0 references
edge coloring
0 references
forbidden subgraph
0 references
0.9503992199897766
0 references
0.944238543510437
0 references
0.944025993347168
0 references
0.8863301277160645
0 references
0.8805418014526367
0 references
