Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 (Q1306426)
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 1347240
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 |
scientific article; zbMATH DE number 1347240 |
Statements
Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 (English)
0 references
4 October 1999
0 references
cubic graph
0 references
edge-coloring
0 references
0.87113994
0 references
0 references
0.8653952
0 references
0.8595105
0 references
0.8575911
0 references
0.85420597
0 references
0.85339445
0 references
0.8512993
0 references
