Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles (Q2713664)
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 coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles |
scientific article; zbMATH DE number 1602791
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles |
scientific article; zbMATH DE number 1602791 |
Statements
10 June 2001
0 references
proper coloring
0 references
properly colored Hamiltonian path
0 references
Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles (English)
0 references
An edge coloring of a graph is proper if no two edges of the same color have a common vertex. Main result: every complete graph \(K_n\) with an edge coloring without monochromatic triangles has a properly colored Hamiltonian path.
0 references
0.8856534361839294
0 references
0.883765459060669
0 references
0.8570354580879211
0 references
0.8538170456886292
0 references
0.8538170456886292
0 references
