Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result (Q1981705)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result |
scientific article; zbMATH DE number 7391501
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result |
scientific article; zbMATH DE number 7391501 |
Statements
Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result (English)
0 references
6 September 2021
0 references
edge-colored graph
0 references
properly edge-colored cycle
0 references
vertex pancyclicity
0 references
Hamilton cycle
0 references
monochromatic triangle
0 references
polynomial algorithm
0 references
0 references
0 references
0 references
