摘要
Wang Vei-fan proved that the edge-face chromatic number of a 2-connected1-tree with the maximum degree is not less than 6 is its maximum degree, and he conjecturedthat it is true when the maximum degree is 5. This paper proves the conjecture.
Wang Wei-fan[1] proved that the edge-face chromatic number of a 2-connected 1-tree with the maximum degree is not less than 6 is its maximum degree, and he conjectured that it is true when the maximum degree is 5. This paper proves the conjecture.
