Title of article
Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5
Author/Authors
Thomassen، نويسنده , , Carsten، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
10
From page
100
To page
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.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1999
Journal title
Journal of Combinatorial Theory Series B
Record number
1526456
Link To Document