Berge-Fulkerson conjecture for graphs with special eight circuits
 发布时间： 2018-12-10     18:24   【返回上一页】 发布人：郝荣霞

In this talk, we will give the following result and its generalizations. Let G be a permutation graph consisting of a 2-factor  and a perfect matching .  If G contains a circuit D of length 8 with edge sequence , where ,  and , then G is Berge-Fulkerson colorable.