当前位置: X-MOL 学术Graphs Comb. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Sufficient Condition for an IC-Planar Graph to be Class 1
Graphs and Combinatorics ( IF 0.6 ) Pub Date : 2021-06-15 , DOI: 10.1007/s00373-021-02353-2
Yuanyuan Duan , Wenyao Song

Two distinct crossings are independent if the end-vertices of any two pairs of crossing edges are disjoint. A graph said to be plane graph with independent crossings or IC-planar, if it can be drawn in the plane such that every two crossings are independent. In this paper, we proved that every IC-planar graph G with \(\varDelta (G) = 7\) admits a proper edge-coloring with \(\varDelta (G)\) colors if G does not contain a 6-cycle with three chords.



中文翻译:

IC 平面图为 1 类的充分条件

如果任意两对交叉边的端点不相交,则两个不同的交叉点是独立的。一个图被称为具有独立交叉点的平面图或 IC-平面图,如果它可以在平面上绘制使得每两个交叉点都是独立的。在本文中,我们证明了每IC-平面图ģ\(\ varDelta(G)= 7 \)承认的适当边缘着色用\(\ varDelta(G)\)的颜色,如果ģ不含有6-用三个和弦循环。

更新日期:2021-06-15
down
wechat
bug