当前位置:
X-MOL 学术
›
Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
The edge colorings of K5-minor free graphs
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-03-01 , DOI: 10.1016/j.disc.2021.112360 Jieru Feng , Yuping Gao , Jianliang Wu
中文翻译:
的边缘着色 -次要免费图表
更新日期:2021-03-02
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-03-01 , DOI: 10.1016/j.disc.2021.112360 Jieru Feng , Yuping Gao , Jianliang Wu
In 1965, Vizing proved that every planar graph with maximum degree is edge -colorable. It is also proved that every planar graph with maximum degree is edge -colorable by Sanders and Zhao, independently by Zhang. In this paper, we extend the above results by showing that every -minor free graph with maximum degree at least seven is edge -colorable.
中文翻译:
的边缘着色 -次要免费图表
1965年,Vizing证明了每个平面图 最高学历 是边缘 -彩色的。也证明了每个平面图 最高学历 是边缘 -由Sanders和Zhao着色,由Zhang独立着色。在本文中,我们通过展示每个-具有最大程度的次要免费图 至少有七个是优势 -彩色的。