The minimum color degree and a large rainbow cycle in an edge-colored graph. (Q3382209)
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 7397947
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum color degree and a large rainbow cycle in an edge-colored graph. |
scientific article; zbMATH DE number 7397947 |
Statements
20 September 2021
0 references
edge coloring
0 references
rainbow subgraph
0 references
color degree
0 references
triangle-free graph
0 references
0.9292126893997192
0 references
0.9169886708259584
0 references
0.8551878929138184
0 references
0.8504737019538879
0 references
0.8480291366577148
0 references
