Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs (Q4638635)
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 6865382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs |
scientific article; zbMATH DE number 6865382 |
Statements
Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs (English)
0 references
27 April 2018
0 references
complete bipartite graphs
0 references
edge-colored graphs
0 references
minimum color degree
0 references
maximum monochromatic degree
0 references
properly colored cycles
0 references
0.96463156
0 references
0.9226073
0 references
0 references
0.9122455
0 references
0.90197295
0 references
0.90191936
0 references
0.89845705
0 references
0.8984357
0 references
