Journal article
Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
In
Journal of Combinatorial Theory. Series B
—
1999, Volume 75, Issue 1, pp. 100-109
Abstract
We prove the conjecture made by Bermond, Fouquet, Habib, and Péroche in 1984 that every cubic graph has an edge-coloring as described in the title. The number 5 cannot be replaced by 4.
| Language: | English |
|---|---|
| Year: | 1999 |
| Pages: | 100-109 |
| ISSN: | 10960902 and 00958956 |
| Types: | Journal article |
| DOI: | 10.1006/jctb.1998.1868 |
| ORCIDs: | Thomassen, Carsten |
