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
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 |
scientific article |
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
